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/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:48,959 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:48,961 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:48,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:48,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:48,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:48,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:48,978 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:48,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:48,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:48,981 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:48,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:48,983 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:48,984 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:48,985 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:48,986 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:48,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:48,988 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:48,991 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:48,992 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:48,993 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:48,995 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:48,997 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:48,997 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:48,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:48,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:49,000 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:49,001 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:49,002 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:49,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:49,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:49,006 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:49,006 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:49,006 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:49,008 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:49,008 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:49,009 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:49,032 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:49,032 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:49,034 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:49,034 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:49,034 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:49,035 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:49,035 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:49,035 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:49,036 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:49,036 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:49,036 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:49,036 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:49,036 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:49,037 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:49,037 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:49,038 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:49,039 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:49,039 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:49,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:49,040 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:49,040 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:49,040 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:49,040 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:49,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:49,041 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:49,041 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:49,042 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:49,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:49,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:49,042 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:49,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:49,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:49,043 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:49,043 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:49,043 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:49,043 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:49,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:49,044 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:49,044 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:49,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:49,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:49,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:49,099 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:49,100 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:49,101 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-03-04 16:23:49,101 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-03-04 16:23:49,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:49,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:49,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:49,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:49,144 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:49,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:49,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:49,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:49,178 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:49,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:49,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:49,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:49,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:49,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (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:49,264 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-03-04 16:23:49,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:23:49,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:23:49,606 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:23:49,607 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-03-04 16:23:49,608 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:49 BoogieIcfgContainer [2019-03-04 16:23:49,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:49,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:49,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:49,612 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:49,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/2) ... [2019-03-04 16:23:49,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730d3d33 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:49, skipping insertion in model container [2019-03-04 16:23:49,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:49" (2/2) ... [2019-03-04 16:23:49,616 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-03-04 16:23:49,625 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:49,633 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:23:49,649 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:23:49,677 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:49,678 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:49,678 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:49,678 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:49,678 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:49,678 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:49,678 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:49,679 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:49,679 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-03-04 16:23:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:23:49,700 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:49,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:23:49,704 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-03-04 16:23:49,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:49,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:49,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:49,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:49,957 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:49,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:49,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:23:49,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:23:49,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:23:49,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:23:49,992 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-03-04 16:23:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:50,173 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-03-04 16:23:50,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:23:50,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-03-04 16:23:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:50,186 INFO L225 Difference]: With dead ends: 26 [2019-03-04 16:23:50,187 INFO L226 Difference]: Without dead ends: 13 [2019-03-04 16:23:50,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:23:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-03-04 16:23:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-03-04 16:23:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:23:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-03-04 16:23:50,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-03-04 16:23:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:50,226 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-03-04 16:23:50,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:23:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-03-04 16:23:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:23:50,226 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:50,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:23:50,227 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:50,228 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-03-04 16:23:50,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:50,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:50,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:50,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:50,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-03-04 16:23:50,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:23:50,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:23:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:23:50,316 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-03-04 16:23:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:50,381 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-03-04 16:23:50,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:23:50,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-03-04 16:23:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:50,383 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:23:50,383 INFO L226 Difference]: Without dead ends: 23 [2019-03-04 16:23:50,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:23:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-03-04 16:23:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-03-04 16:23:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:23:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-03-04 16:23:50,390 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-03-04 16:23:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:50,391 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-03-04 16:23:50,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:23:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-03-04 16:23:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:23:50,392 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:50,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:23:50,392 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-03-04 16:23:50,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:50,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:23:50,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:50,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:23:50,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:23:50,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:23:50,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:50,426 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-03-04 16:23:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:50,510 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-03-04 16:23:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:23:50,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-03-04 16:23:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:50,511 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:23:50,511 INFO L226 Difference]: Without dead ends: 13 [2019-03-04 16:23:50,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-03-04 16:23:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-03-04 16:23:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:23:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-03-04 16:23:50,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-03-04 16:23:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:50,516 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-03-04 16:23:50,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:23:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-03-04 16:23:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:23:50,517 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:50,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:23:50,517 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:50,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:50,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-03-04 16:23:50,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:50,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,878 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-03-04 16:23:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:50,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:50,919 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:50,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:23:50,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:51,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-03-04 16:23:51,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:23:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:23:51,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:23:51,051 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-03-04 16:23:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:51,310 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-03-04 16:23:51,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:23:51,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-03-04 16:23:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:51,314 INFO L225 Difference]: With dead ends: 26 [2019-03-04 16:23:51,314 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:23:51,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:23:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:23:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-03-04 16:23:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-03-04 16:23:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-03-04 16:23:51,319 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-03-04 16:23:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:51,319 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-03-04 16:23:51,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:23:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-03-04 16:23:51,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-03-04 16:23:51,320 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:51,320 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:23:51,321 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:51,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:51,321 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-03-04 16:23:51,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:51,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:51,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:51,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:51,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:51,384 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:51,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:51,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:23:51,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:51,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:51,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-03-04 16:23:51,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:23:51,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:23:51,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:23:51,540 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-03-04 16:23:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:51,928 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-03-04 16:23:51,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:23:51,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-03-04 16:23:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:51,929 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:23:51,929 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:23:51,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:23:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:23:51,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-03-04 16:23:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:23:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-03-04 16:23:51,935 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-03-04 16:23:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:51,935 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-03-04 16:23:51,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:23:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-03-04 16:23:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-03-04 16:23:51,936 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:51,936 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:23:51,936 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:51,937 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-03-04 16:23:51,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:51,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:51,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:51,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:52,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:52,287 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:52,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:52,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:52,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:52,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:23:52,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:52,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:52,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-03-04 16:23:52,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-03-04 16:23:52,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-03-04 16:23:52,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:23:52,637 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 15 states. [2019-03-04 16:23:52,899 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2019-03-04 16:23:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:53,446 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-03-04 16:23:53,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:23:53,447 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-03-04 16:23:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:53,448 INFO L225 Difference]: With dead ends: 43 [2019-03-04 16:23:53,448 INFO L226 Difference]: Without dead ends: 27 [2019-03-04 16:23:53,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2019-03-04 16:23:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-03-04 16:23:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-03-04 16:23:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:23:53,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-03-04 16:23:53,455 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-03-04 16:23:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:53,456 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-03-04 16:23:53,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-03-04 16:23:53,456 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-03-04 16:23:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-03-04 16:23:53,457 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:53,457 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-03-04 16:23:53,457 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:53,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:53,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 3 times [2019-03-04 16:23:53,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:53,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:53,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:53,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:53,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:53,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:53,815 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:53,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:23:53,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:23:53,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:53,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:23:53,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:53,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:53,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-03-04 16:23:53,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:23:53,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:23:53,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:53,959 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-03-04 16:23:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:54,417 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-03-04 16:23:54,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:23:54,418 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-03-04 16:23:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:54,420 INFO L225 Difference]: With dead ends: 49 [2019-03-04 16:23:54,420 INFO L226 Difference]: Without dead ends: 39 [2019-03-04 16:23:54,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:23:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-03-04 16:23:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-03-04 16:23:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:23:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-03-04 16:23:54,434 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-03-04 16:23:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:54,435 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-03-04 16:23:54,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:23:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-03-04 16:23:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-03-04 16:23:54,437 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:54,437 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-03-04 16:23:54,437 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 4 times [2019-03-04 16:23:54,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:54,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:54,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:54,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:54,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:54,766 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:54,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:23:54,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:23:54,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:54,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:23:54,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:54,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:54,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-03-04 16:23:54,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:23:54,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:23:54,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:54,901 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-03-04 16:23:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:55,068 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-03-04 16:23:55,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:23:55,069 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-03-04 16:23:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:55,070 INFO L225 Difference]: With dead ends: 60 [2019-03-04 16:23:55,070 INFO L226 Difference]: Without dead ends: 33 [2019-03-04 16:23:55,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:23:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-03-04 16:23:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-03-04 16:23:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:23:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-03-04 16:23:55,077 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-03-04 16:23:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:55,077 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-03-04 16:23:55,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:23:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-03-04 16:23:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-03-04 16:23:55,079 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:55,079 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-03-04 16:23:55,079 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 5 times [2019-03-04 16:23:55,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:55,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:55,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:55,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:55,322 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:23:55,345 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-03-04 16:23:55,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:55,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:23:55,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:55,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-03-04 16:23:55,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-03-04 16:23:55,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-03-04 16:23:55,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:23:55,515 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-03-04 16:23:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:56,130 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-03-04 16:23:56,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-03-04 16:23:56,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-03-04 16:23:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:56,132 INFO L225 Difference]: With dead ends: 64 [2019-03-04 16:23:56,132 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:23:56,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-03-04 16:23:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:23:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-03-04 16:23:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-03-04 16:23:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-03-04 16:23:56,140 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-03-04 16:23:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:56,140 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-03-04 16:23:56,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-03-04 16:23:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-03-04 16:23:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-03-04 16:23:56,142 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:56,142 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-03-04 16:23:56,142 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 6 times [2019-03-04 16:23:56,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:56,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:56,327 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:56,343 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:23:56,365 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-03-04 16:23:56,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:56,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:23:56,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:56,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-03-04 16:23:56,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-03-04 16:23:56,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-03-04 16:23:56,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:23:56,600 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-03-04 16:23:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:56,844 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-03-04 16:23:56,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:23:56,845 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-03-04 16:23:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:56,845 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:23:56,845 INFO L226 Difference]: Without dead ends: 40 [2019-03-04 16:23:56,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:23:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-03-04 16:23:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-03-04 16:23:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:23:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-03-04 16:23:56,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-03-04 16:23:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:56,854 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-03-04 16:23:56,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-03-04 16:23:56,854 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-03-04 16:23:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-03-04 16:23:56,855 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:56,855 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-03-04 16:23:56,855 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:56,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:56,856 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 7 times [2019-03-04 16:23:56,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:56,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:56,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:56,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:57,510 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:57,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:57,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 23 conjunts are in the unsatisfiable core [2019-03-04 16:23:57,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:57,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2019-03-04 16:23:57,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:23:57,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:23:57,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:23:57,738 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 20 states. [2019-03-04 16:23:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:58,460 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2019-03-04 16:23:58,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-03-04 16:23:58,461 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-03-04 16:23:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:58,462 INFO L225 Difference]: With dead ends: 79 [2019-03-04 16:23:58,462 INFO L226 Difference]: Without dead ends: 61 [2019-03-04 16:23:58,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2019-03-04 16:23:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-03-04 16:23:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2019-03-04 16:23:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-03-04 16:23:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-03-04 16:23:58,471 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2019-03-04 16:23:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:58,472 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-03-04 16:23:58,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:23:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-03-04 16:23:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-03-04 16:23:58,473 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:58,473 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-03-04 16:23:58,473 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash 451793069, now seen corresponding path program 8 times [2019-03-04 16:23:58,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:58,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:58,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:23:58,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:58,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:58,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:58,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:23:58,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:58,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-03-04 16:23:58,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:23:58,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:23:58,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:23:58,751 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 20 states. [2019-03-04 16:23:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:58,998 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-03-04 16:23:58,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-03-04 16:23:58,999 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-03-04 16:23:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:59,000 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:23:59,001 INFO L226 Difference]: Without dead ends: 47 [2019-03-04 16:23:59,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:23:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-03-04 16:23:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-03-04 16:23:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-03-04 16:23:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-03-04 16:23:59,009 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 41 [2019-03-04 16:23:59,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:59,010 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-03-04 16:23:59,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:23:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-03-04 16:23:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-03-04 16:23:59,011 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:59,011 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-03-04 16:23:59,011 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-03-04 16:23:59,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:59,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:59,283 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:23:59,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:23:59,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-03-04 16:23:59,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:59,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:23:59,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 50 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:59,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2019-03-04 16:23:59,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-03-04 16:23:59,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-03-04 16:23:59,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2019-03-04 16:23:59,883 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 31 states. [2019-03-04 16:24:00,735 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-03-04 16:24:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:03,107 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2019-03-04 16:24:03,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:24:03,108 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2019-03-04 16:24:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:03,110 INFO L225 Difference]: With dead ends: 116 [2019-03-04 16:24:03,110 INFO L226 Difference]: Without dead ends: 69 [2019-03-04 16:24:03,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=469, Invalid=3953, Unknown=0, NotChecked=0, Total=4422 [2019-03-04 16:24:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-03-04 16:24:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2019-03-04 16:24:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:24:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-03-04 16:24:03,121 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 44 [2019-03-04 16:24:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:03,121 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-03-04 16:24:03,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-03-04 16:24:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-03-04 16:24:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-03-04 16:24:03,122 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:03,123 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-03-04 16:24:03,123 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 10 times [2019-03-04 16:24:03,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:03,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:03,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:03,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 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:03,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:03,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:03,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:03,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 31 conjunts are in the unsatisfiable core [2019-03-04 16:24:03,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:03,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:03,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 25 [2019-03-04 16:24:03,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:24:03,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:24:03,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:24:03,697 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-03-04 16:24:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:04,776 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-03-04 16:24:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-03-04 16:24:04,777 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-03-04 16:24:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:04,778 INFO L225 Difference]: With dead ends: 109 [2019-03-04 16:24:04,778 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:24:04,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-03-04 16:24:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:24:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-03-04 16:24:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-03-04 16:24:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-03-04 16:24:04,788 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-03-04 16:24:04,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:04,788 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-03-04 16:24:04,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:24:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-03-04 16:24:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-03-04 16:24:04,789 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:04,790 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-03-04 16:24:04,790 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:04,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 11 times [2019-03-04 16:24:04,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:04,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:04,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:04,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:04,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:05,249 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:05,258 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:05,274 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-03-04 16:24:05,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:05,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:24:05,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:05,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-03-04 16:24:05,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:24:05,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:24:05,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:24:05,528 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-03-04 16:24:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:05,865 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-03-04 16:24:05,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-03-04 16:24:05,866 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-03-04 16:24:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:05,866 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:24:05,867 INFO L226 Difference]: Without dead ends: 61 [2019-03-04 16:24:05,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-03-04 16:24:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-03-04 16:24:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-03-04 16:24:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:24:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-03-04 16:24:05,876 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-03-04 16:24:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:05,877 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-03-04 16:24:05,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:24:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-03-04 16:24:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-03-04 16:24:05,878 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:05,878 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-03-04 16:24:05,879 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 12 times [2019-03-04 16:24:05,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:05,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:06,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:06,318 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:06,329 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:06,367 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-03-04 16:24:06,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:06,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2019-03-04 16:24:06,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:06,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:06,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2019-03-04 16:24:06,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-03-04 16:24:06,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-03-04 16:24:06,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:24:06,681 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-03-04 16:24:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:08,401 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-03-04 16:24:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-03-04 16:24:08,401 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-03-04 16:24:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:08,402 INFO L225 Difference]: With dead ends: 124 [2019-03-04 16:24:08,403 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:24:08,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-03-04 16:24:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:24:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-03-04 16:24:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-03-04 16:24:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-03-04 16:24:08,421 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-03-04 16:24:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:08,421 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-03-04 16:24:08,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-03-04 16:24:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-03-04 16:24:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-03-04 16:24:08,423 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:08,423 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-03-04 16:24:08,424 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:08,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:08,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 13 times [2019-03-04 16:24:08,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:08,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:08,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:08,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:08,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:08,736 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:08,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:08,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:24:08,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:08,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:08,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-03-04 16:24:08,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-03-04 16:24:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-03-04 16:24:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:24:08,966 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-03-04 16:24:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:09,457 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-03-04 16:24:09,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-03-04 16:24:09,460 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-03-04 16:24:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:09,461 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:24:09,461 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:24:09,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:24:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:24:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-03-04 16:24:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:24:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-03-04 16:24:09,471 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-03-04 16:24:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:09,472 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-03-04 16:24:09,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-03-04 16:24:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-03-04 16:24:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-03-04 16:24:09,473 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:09,473 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-03-04 16:24:09,473 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:09,474 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 14 times [2019-03-04 16:24:09,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:09,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:09,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:09,904 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:09,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:09,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:09,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:09,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjunts are in the unsatisfiable core [2019-03-04 16:24:09,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 128 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:10,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2019-03-04 16:24:10,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-03-04 16:24:10,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-03-04 16:24:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1584, Unknown=0, NotChecked=0, Total=1806 [2019-03-04 16:24:10,694 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 43 states. [2019-03-04 16:24:13,088 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-03-04 16:24:13,572 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-03-04 16:24:14,205 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2019-03-04 16:24:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:15,043 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2019-03-04 16:24:15,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-03-04 16:24:15,044 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 65 [2019-03-04 16:24:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:15,045 INFO L225 Difference]: With dead ends: 173 [2019-03-04 16:24:15,045 INFO L226 Difference]: Without dead ends: 102 [2019-03-04 16:24:15,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1993 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=829, Invalid=8483, Unknown=0, NotChecked=0, Total=9312 [2019-03-04 16:24:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-03-04 16:24:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 73. [2019-03-04 16:24:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:24:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-03-04 16:24:15,061 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 65 [2019-03-04 16:24:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:15,061 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-03-04 16:24:15,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-03-04 16:24:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-03-04 16:24:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-03-04 16:24:15,062 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:15,062 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-03-04 16:24:15,063 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 15 times [2019-03-04 16:24:15,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:15,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:15,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:15,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:15,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-03-04 16:24:15,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:15,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2019-03-04 16:24:15,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:16,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:16,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2019-03-04 16:24:16,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-03-04 16:24:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-03-04 16:24:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1902, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:24:16,637 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-03-04 16:24:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:20,859 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-03-04 16:24:20,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 16:24:20,860 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-03-04 16:24:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:20,861 INFO L225 Difference]: With dead ends: 192 [2019-03-04 16:24:20,861 INFO L226 Difference]: Without dead ends: 113 [2019-03-04 16:24:20,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2443 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=969, Invalid=10373, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 16:24:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-03-04 16:24:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-03-04 16:24:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:24:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-03-04 16:24:20,874 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-03-04 16:24:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:20,874 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-03-04 16:24:20,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-03-04 16:24:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-03-04 16:24:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-03-04 16:24:20,875 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:20,875 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-03-04 16:24:20,875 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 16 times [2019-03-04 16:24:20,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:20,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:20,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:20,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:20,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:21,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:21,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 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:21,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:21,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:21,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:21,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 47 conjunts are in the unsatisfiable core [2019-03-04 16:24:21,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:21,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:21,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 37 [2019-03-04 16:24:21,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:24:21,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:24:21,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:24:21,889 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-03-04 16:24:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:24,370 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-03-04 16:24:24,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-03-04 16:24:24,371 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-03-04 16:24:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:24,371 INFO L225 Difference]: With dead ends: 169 [2019-03-04 16:24:24,371 INFO L226 Difference]: Without dead ends: 127 [2019-03-04 16:24:24,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-03-04 16:24:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-03-04 16:24:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-03-04 16:24:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-03-04 16:24:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-03-04 16:24:24,386 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-03-04 16:24:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:24,386 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-03-04 16:24:24,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:24:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-03-04 16:24:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-03-04 16:24:24,387 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:24,387 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-03-04 16:24:24,387 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:24,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:24,388 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 17 times [2019-03-04 16:24:24,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:24,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:24,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:24,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:24,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:24,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:24,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24,720 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:24,739 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-03-04 16:24:24,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:24,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-03-04 16:24:24,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:25,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:25,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2019-03-04 16:24:25,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:24:25,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:24:25,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:24:25,064 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-03-04 16:24:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:25,599 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-03-04 16:24:25,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-03-04 16:24:25,600 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-03-04 16:24:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:25,601 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:24:25,601 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:24:25,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:24:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:24:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-03-04 16:24:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-03-04 16:24:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-03-04 16:24:25,612 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-03-04 16:24:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:25,612 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-03-04 16:24:25,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:24:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-03-04 16:24:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-03-04 16:24:25,612 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:25,613 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-03-04 16:24:25,613 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:25,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:25,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 18 times [2019-03-04 16:24:25,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:25,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:25,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:25,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:25,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:26,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:26,145 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:26,153 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:26,174 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-03-04 16:24:26,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:26,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 51 conjunts are in the unsatisfiable core [2019-03-04 16:24:26,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:26,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:26,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 40 [2019-03-04 16:24:26,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-03-04 16:24:26,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-03-04 16:24:26,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1534, Unknown=0, NotChecked=0, Total=1640 [2019-03-04 16:24:26,631 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 41 states. [2019-03-04 16:24:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:29,572 INFO L93 Difference]: Finished difference Result 184 states and 189 transitions. [2019-03-04 16:24:29,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-03-04 16:24:29,577 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2019-03-04 16:24:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:29,578 INFO L225 Difference]: With dead ends: 184 [2019-03-04 16:24:29,578 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:24:29,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=359, Invalid=3801, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:24:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:24:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 91. [2019-03-04 16:24:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:24:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2019-03-04 16:24:29,592 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 86 [2019-03-04 16:24:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:29,592 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2019-03-04 16:24:29,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-03-04 16:24:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2019-03-04 16:24:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-03-04 16:24:29,593 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:29,593 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2019-03-04 16:24:29,593 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:29,594 INFO L82 PathProgramCache]: Analyzing trace with hash 310818374, now seen corresponding path program 19 times [2019-03-04 16:24:29,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:29,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:29,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:29,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:29,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 300 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:30,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:30,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 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:30,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:30,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 28 conjunts are in the unsatisfiable core [2019-03-04 16:24:30,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 300 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:30,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:30,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2019-03-04 16:24:30,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-03-04 16:24:30,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-03-04 16:24:30,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2019-03-04 16:24:30,897 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 41 states. [2019-03-04 16:24:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:31,462 INFO L93 Difference]: Finished difference Result 195 states and 199 transitions. [2019-03-04 16:24:31,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-03-04 16:24:31,463 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 90 [2019-03-04 16:24:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:31,464 INFO L225 Difference]: With dead ends: 195 [2019-03-04 16:24:31,464 INFO L226 Difference]: Without dead ends: 96 [2019-03-04 16:24:31,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=2159, Unknown=0, NotChecked=0, Total=2862 [2019-03-04 16:24:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-03-04 16:24:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-03-04 16:24:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-03-04 16:24:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-03-04 16:24:31,476 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 90 [2019-03-04 16:24:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:31,477 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-03-04 16:24:31,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-03-04 16:24:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-03-04 16:24:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-03-04 16:24:31,478 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:31,478 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-03-04 16:24:31,478 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:31,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 20 times [2019-03-04 16:24:31,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:31,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:31,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:31,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:32,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:32,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:32,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:32,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:32,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 32 conjunts are in the unsatisfiable core [2019-03-04 16:24:32,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 288 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:33,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:33,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 58 [2019-03-04 16:24:33,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-03-04 16:24:33,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-03-04 16:24:33,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=3030, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:24:33,620 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 59 states. [2019-03-04 16:24:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:39,894 INFO L93 Difference]: Finished difference Result 249 states and 255 transitions. [2019-03-04 16:24:39,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-03-04 16:24:39,895 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 93 [2019-03-04 16:24:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:39,896 INFO L225 Difference]: With dead ends: 249 [2019-03-04 16:24:39,896 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:24:39,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4069 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1449, Invalid=17183, Unknown=0, NotChecked=0, Total=18632 [2019-03-04 16:24:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:24:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 101. [2019-03-04 16:24:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:24:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-03-04 16:24:39,911 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 93 [2019-03-04 16:24:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:39,911 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-03-04 16:24:39,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-03-04 16:24:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-03-04 16:24:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-03-04 16:24:39,912 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:39,912 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-03-04 16:24:39,912 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 21 times [2019-03-04 16:24:39,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:39,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:39,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:40,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:40,756 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:40,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:40,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-03-04 16:24:40,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:40,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 59 conjunts are in the unsatisfiable core [2019-03-04 16:24:40,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:41,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:41,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 46 [2019-03-04 16:24:41,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-03-04 16:24:41,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-03-04 16:24:41,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:24:41,481 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-03-04 16:24:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:44,993 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-03-04 16:24:44,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-03-04 16:24:44,993 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-03-04 16:24:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:44,995 INFO L225 Difference]: With dead ends: 214 [2019-03-04 16:24:44,995 INFO L226 Difference]: Without dead ends: 160 [2019-03-04 16:24:44,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-03-04 16:24:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-03-04 16:24:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-03-04 16:24:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-03-04 16:24:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-03-04 16:24:45,008 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-03-04 16:24:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:45,009 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-03-04 16:24:45,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-03-04 16:24:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-03-04 16:24:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-03-04 16:24:45,010 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:45,010 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-03-04 16:24:45,010 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:45,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:45,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 22 times [2019-03-04 16:24:45,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:45,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:45,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:45,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:45,394 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:45,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:24:45,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:24:45,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:45,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 32 conjunts are in the unsatisfiable core [2019-03-04 16:24:45,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:45,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:45,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2019-03-04 16:24:45,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-03-04 16:24:45,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-03-04 16:24:45,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:24:45,900 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-03-04 16:24:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:46,606 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-03-04 16:24:46,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-03-04 16:24:46,607 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-03-04 16:24:46,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:46,608 INFO L225 Difference]: With dead ends: 225 [2019-03-04 16:24:46,608 INFO L226 Difference]: Without dead ends: 110 [2019-03-04 16:24:46,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:24:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-03-04 16:24:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-03-04 16:24:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:24:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-03-04 16:24:46,622 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-03-04 16:24:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:46,622 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-03-04 16:24:46,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-03-04 16:24:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-03-04 16:24:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-03-04 16:24:46,623 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:46,623 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-03-04 16:24:46,623 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:46,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 23 times [2019-03-04 16:24:46,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:46,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:47,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:47,336 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:47,345 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:24:47,370 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-03-04 16:24:47,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:47,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 63 conjunts are in the unsatisfiable core [2019-03-04 16:24:47,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:48,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:48,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 49 [2019-03-04 16:24:48,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:24:48,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:24:48,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:24:48,033 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-03-04 16:24:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:51,879 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-03-04 16:24:51,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-03-04 16:24:51,881 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-03-04 16:24:51,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:51,883 INFO L225 Difference]: With dead ends: 229 [2019-03-04 16:24:51,883 INFO L226 Difference]: Without dead ends: 171 [2019-03-04 16:24:51,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:24:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-03-04 16:24:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-03-04 16:24:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-03-04 16:24:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-03-04 16:24:51,904 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-03-04 16:24:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:51,904 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-03-04 16:24:51,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:24:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-03-04 16:24:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-03-04 16:24:51,905 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:51,905 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-03-04 16:24:51,905 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 24 times [2019-03-04 16:24:51,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:51,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:51,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:51,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:52,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:52,334 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:52,343 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:24:52,370 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-03-04 16:24:52,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:52,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 34 conjunts are in the unsatisfiable core [2019-03-04 16:24:52,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:52,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:52,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2019-03-04 16:24:52,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:24:52,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:24:52,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:24:52,822 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-03-04 16:24:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:54,440 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-03-04 16:24:54,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-03-04 16:24:54,441 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-03-04 16:24:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:54,442 INFO L225 Difference]: With dead ends: 240 [2019-03-04 16:24:54,442 INFO L226 Difference]: Without dead ends: 117 [2019-03-04 16:24:54,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-03-04 16:24:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-03-04 16:24:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-03-04 16:24:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-03-04 16:24:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-03-04 16:24:54,460 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-03-04 16:24:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:54,460 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-03-04 16:24:54,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:24:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-03-04 16:24:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-03-04 16:24:54,461 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:54,461 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-03-04 16:24:54,461 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 25 times [2019-03-04 16:24:54,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:54,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:54,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:54,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:55,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:55,286 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:55,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:55,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 67 conjunts are in the unsatisfiable core [2019-03-04 16:24:55,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:56,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:56,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 52 [2019-03-04 16:24:56,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-03-04 16:24:56,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-03-04 16:24:56,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:24:56,131 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-03-04 16:25:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:00,376 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-03-04 16:25:00,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-03-04 16:25:00,377 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-03-04 16:25:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:00,378 INFO L225 Difference]: With dead ends: 244 [2019-03-04 16:25:00,379 INFO L226 Difference]: Without dead ends: 182 [2019-03-04 16:25:00,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-03-04 16:25:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-03-04 16:25:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-03-04 16:25:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-03-04 16:25:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-03-04 16:25:00,399 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-03-04 16:25:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:00,399 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-03-04 16:25:00,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-03-04 16:25:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-03-04 16:25:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-03-04 16:25:00,400 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:00,400 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-03-04 16:25:00,400 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 26 times [2019-03-04 16:25:00,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:00,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:00,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:00,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:00,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:01,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:01,037 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:25:01,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:01,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:01,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:01,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2019-03-04 16:25:01,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:01,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:01,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2019-03-04 16:25:01,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-03-04 16:25:01,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-03-04 16:25:01,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:25:01,610 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-03-04 16:25:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:02,688 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-03-04 16:25:02,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-03-04 16:25:02,688 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-03-04 16:25:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:02,689 INFO L225 Difference]: With dead ends: 255 [2019-03-04 16:25:02,689 INFO L226 Difference]: Without dead ends: 124 [2019-03-04 16:25:02,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-03-04 16:25:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-03-04 16:25:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-03-04 16:25:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-03-04 16:25:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-03-04 16:25:02,711 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-03-04 16:25:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:02,711 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-03-04 16:25:02,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-03-04 16:25:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-03-04 16:25:02,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-03-04 16:25:02,712 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:02,712 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-03-04 16:25:02,713 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:02,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:02,713 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 27 times [2019-03-04 16:25:02,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:02,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:02,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:02,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:02,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:04,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:04,054 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:25:04,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:04,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-03-04 16:25:04,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:04,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:25:04,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:06,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:06,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 74 [2019-03-04 16:25:06,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-03-04 16:25:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-03-04 16:25:06,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=4940, Unknown=0, NotChecked=0, Total=5550 [2019-03-04 16:25:06,037 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-03-04 16:25:14,088 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-03-04 16:25:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:16,027 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-03-04 16:25:16,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-03-04 16:25:16,027 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-03-04 16:25:16,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:16,029 INFO L225 Difference]: With dead ends: 325 [2019-03-04 16:25:16,029 INFO L226 Difference]: Without dead ends: 190 [2019-03-04 16:25:16,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6881 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2229, Invalid=28923, Unknown=0, NotChecked=0, Total=31152 [2019-03-04 16:25:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-03-04 16:25:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-03-04 16:25:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-03-04 16:25:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-03-04 16:25:16,048 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-03-04 16:25:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:16,048 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-03-04 16:25:16,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-03-04 16:25:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-03-04 16:25:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-03-04 16:25:16,048 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:16,048 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-03-04 16:25:16,049 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 28 times [2019-03-04 16:25:16,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:16,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:16,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:16,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:16,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:17,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:17,084 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:25:17,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:25:17,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:25:17,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:17,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 75 conjunts are in the unsatisfiable core [2019-03-04 16:25:17,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:18,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:18,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38] total 58 [2019-03-04 16:25:18,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-03-04 16:25:18,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-03-04 16:25:18,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:25:18,020 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-03-04 16:25:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:23,910 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-03-04 16:25:23,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-03-04 16:25:23,911 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-03-04 16:25:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:23,912 INFO L225 Difference]: With dead ends: 274 [2019-03-04 16:25:23,913 INFO L226 Difference]: Without dead ends: 204 [2019-03-04 16:25:23,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:25:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-03-04 16:25:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-03-04 16:25:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:25:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-03-04 16:25:23,940 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-03-04 16:25:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:23,940 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-03-04 16:25:23,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-03-04 16:25:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-03-04 16:25:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-03-04 16:25:23,942 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:23,942 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-03-04 16:25:23,942 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 29 times [2019-03-04 16:25:23,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:23,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:23,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:24,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:24,874 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:25:24,883 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:25:25,027 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-03-04 16:25:25,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:25,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:25:25,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:25,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:25,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 58 [2019-03-04 16:25:25,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-03-04 16:25:25,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-03-04 16:25:25,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:25:25,649 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-03-04 16:25:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:26,694 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-03-04 16:25:26,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-03-04 16:25:26,695 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-03-04 16:25:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:26,696 INFO L225 Difference]: With dead ends: 285 [2019-03-04 16:25:26,696 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:25:26,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-03-04 16:25:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:25:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-03-04 16:25:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:25:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-03-04 16:25:26,721 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-03-04 16:25:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:26,722 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-03-04 16:25:26,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-03-04 16:25:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-03-04 16:25:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-03-04 16:25:26,722 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:26,722 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-03-04 16:25:26,723 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:26,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:26,723 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 30 times [2019-03-04 16:25:26,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:26,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:26,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:26,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:26,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:27,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:27,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 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:25:27,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:25:27,948 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-03-04 16:25:27,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:27,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjunts are in the unsatisfiable core [2019-03-04 16:25:27,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:31,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:31,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 82 [2019-03-04 16:25:31,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-03-04 16:25:31,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-03-04 16:25:31,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=6069, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:25:31,249 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-03-04 16:25:40,320 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-03-04 16:25:40,561 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-03-04 16:25:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:42,816 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-03-04 16:25:42,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-03-04 16:25:42,816 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-03-04 16:25:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:42,818 INFO L225 Difference]: With dead ends: 363 [2019-03-04 16:25:42,819 INFO L226 Difference]: Without dead ends: 212 [2019-03-04 16:25:42,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8563 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2679, Invalid=35933, Unknown=0, NotChecked=0, Total=38612 [2019-03-04 16:25:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-03-04 16:25:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-03-04 16:25:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-03-04 16:25:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-03-04 16:25:42,843 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-03-04 16:25:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:42,844 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-03-04 16:25:42,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-03-04 16:25:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-03-04 16:25:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-03-04 16:25:42,845 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:42,845 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-03-04 16:25:42,845 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:42,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 31 times [2019-03-04 16:25:42,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:42,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:42,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:42,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:44,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:44,584 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:25:44,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:44,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 83 conjunts are in the unsatisfiable core [2019-03-04 16:25:44,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:45,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:45,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 64 [2019-03-04 16:25:45,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-03-04 16:25:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-03-04 16:25:45,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:25:45,929 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-03-04 16:25:51,114 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-03-04 16:25:51,391 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-03-04 16:25:51,677 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-03-04 16:25:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:53,540 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-03-04 16:25:53,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-03-04 16:25:53,540 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-03-04 16:25:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:53,542 INFO L225 Difference]: With dead ends: 304 [2019-03-04 16:25:53,542 INFO L226 Difference]: Without dead ends: 226 [2019-03-04 16:25:53,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-03-04 16:25:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-03-04 16:25:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-03-04 16:25:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-03-04 16:25:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-03-04 16:25:53,568 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-03-04 16:25:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:53,568 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-03-04 16:25:53,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-03-04 16:25:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-03-04 16:25:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-03-04 16:25:53,569 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:53,569 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-03-04 16:25:53,569 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:53,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:53,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 32 times [2019-03-04 16:25:53,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:53,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:53,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:53,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:53,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:54,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:54,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:54,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:54,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:54,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:54,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 44 conjunts are in the unsatisfiable core [2019-03-04 16:25:54,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:55,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:55,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 64 [2019-03-04 16:25:55,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-03-04 16:25:55,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-03-04 16:25:55,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:25:55,464 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-03-04 16:25:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:56,827 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-03-04 16:25:56,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:25:56,828 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-03-04 16:25:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:56,830 INFO L225 Difference]: With dead ends: 315 [2019-03-04 16:25:56,830 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:25:56,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:25:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:25:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-03-04 16:25:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-03-04 16:25:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-03-04 16:25:56,857 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-03-04 16:25:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:56,857 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-03-04 16:25:56,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-03-04 16:25:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-03-04 16:25:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-03-04 16:25:56,858 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:56,858 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-03-04 16:25:56,858 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:56,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:56,859 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 33 times [2019-03-04 16:25:56,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:56,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:56,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:56,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:56,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:58,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:58,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:58,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:58,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-03-04 16:25:58,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:58,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2019-03-04 16:25:58,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:01,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:01,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46] total 90 [2019-03-04 16:26:01,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-03-04 16:26:01,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-03-04 16:26:01,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=876, Invalid=7314, Unknown=0, NotChecked=0, Total=8190 [2019-03-04 16:26:01,191 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-03-04 16:26:11,776 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-03-04 16:26:12,051 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-03-04 16:26:12,342 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-03-04 16:26:12,580 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:26:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:14,933 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-03-04 16:26:14,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-03-04 16:26:14,934 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-03-04 16:26:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:14,935 INFO L225 Difference]: With dead ends: 401 [2019-03-04 16:26:14,935 INFO L226 Difference]: Without dead ends: 234 [2019-03-04 16:26:14,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10429 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=3169, Invalid=43703, Unknown=0, NotChecked=0, Total=46872 [2019-03-04 16:26:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-03-04 16:26:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-03-04 16:26:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-03-04 16:26:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-03-04 16:26:14,969 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-03-04 16:26:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:14,969 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-03-04 16:26:14,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-03-04 16:26:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-03-04 16:26:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-03-04 16:26:14,970 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:14,970 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-03-04 16:26:14,970 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:14,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 34 times [2019-03-04 16:26:14,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:14,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:14,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:14,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:14,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:16,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:16,736 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:26:16,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:26:16,771 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:26:16,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:16,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 91 conjunts are in the unsatisfiable core [2019-03-04 16:26:16,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:18,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:18,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46] total 70 [2019-03-04 16:26:18,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-03-04 16:26:18,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-03-04 16:26:18,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:26:18,101 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-03-04 16:26:23,300 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-03-04 16:26:23,610 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-03-04 16:26:23,905 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-03-04 16:26:24,103 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:26:24,292 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:26:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:26,461 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-03-04 16:26:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-03-04 16:26:26,461 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-03-04 16:26:26,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:26,463 INFO L225 Difference]: With dead ends: 334 [2019-03-04 16:26:26,463 INFO L226 Difference]: Without dead ends: 248 [2019-03-04 16:26:26,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2029 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-03-04 16:26:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-03-04 16:26:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-03-04 16:26:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-03-04 16:26:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-03-04 16:26:26,501 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-03-04 16:26:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:26,502 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-03-04 16:26:26,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-03-04 16:26:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-03-04 16:26:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-03-04 16:26:26,503 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:26,503 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-03-04 16:26:26,503 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:26,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:26,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 35 times [2019-03-04 16:26:26,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:26,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:26,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:26,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:26,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:27,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:27,649 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:26:27,659 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:26:27,701 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-03-04 16:26:27,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:27,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjunts are in the unsatisfiable core [2019-03-04 16:26:27,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:29,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:29,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 70 [2019-03-04 16:26:29,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-03-04 16:26:29,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-03-04 16:26:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:26:29,656 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-03-04 16:26:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:31,430 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-03-04 16:26:31,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-03-04 16:26:31,431 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-03-04 16:26:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:31,432 INFO L225 Difference]: With dead ends: 345 [2019-03-04 16:26:31,433 INFO L226 Difference]: Without dead ends: 166 [2019-03-04 16:26:31,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-03-04 16:26:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-03-04 16:26:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-03-04 16:26:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-03-04 16:26:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-03-04 16:26:31,460 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-03-04 16:26:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:31,460 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-03-04 16:26:31,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-03-04 16:26:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-03-04 16:26:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-03-04 16:26:31,461 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:31,461 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-03-04 16:26:31,461 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:31,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 36 times [2019-03-04 16:26:31,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:31,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:31,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:32,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:32,964 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:26:32,973 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:26:33,016 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2019-03-04 16:26:33,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:33,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 95 conjunts are in the unsatisfiable core [2019-03-04 16:26:33,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:34,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:34,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48] total 73 [2019-03-04 16:26:34,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:26:34,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:26:34,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:26:34,398 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-03-04 16:26:40,851 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-03-04 16:26:41,247 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-03-04 16:26:41,600 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-03-04 16:26:41,826 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:26:42,035 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:26:42,233 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:26:44,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:44,303 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-03-04 16:26:44,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-03-04 16:26:44,304 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-03-04 16:26:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:44,305 INFO L225 Difference]: With dead ends: 349 [2019-03-04 16:26:44,305 INFO L226 Difference]: Without dead ends: 259 [2019-03-04 16:26:44,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2213 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-03-04 16:26:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-03-04 16:26:44,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-03-04 16:26:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-03-04 16:26:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-03-04 16:26:44,345 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-03-04 16:26:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:44,346 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-03-04 16:26:44,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:26:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-03-04 16:26:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-03-04 16:26:44,347 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:44,347 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-03-04 16:26:44,347 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:44,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 37 times [2019-03-04 16:26:44,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:44,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:44,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:44,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:44,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:45,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:45,493 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:26:45,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:45,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 50 conjunts are in the unsatisfiable core [2019-03-04 16:26:45,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:46,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:46,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 73 [2019-03-04 16:26:46,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:26:46,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:26:46,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:26:46,637 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-03-04 16:26:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:48,380 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-03-04 16:26:48,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-03-04 16:26:48,380 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-03-04 16:26:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:48,382 INFO L225 Difference]: With dead ends: 360 [2019-03-04 16:26:48,382 INFO L226 Difference]: Without dead ends: 173 [2019-03-04 16:26:48,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-03-04 16:26:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-03-04 16:26:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-03-04 16:26:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-03-04 16:26:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-03-04 16:26:48,411 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-03-04 16:26:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:48,411 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-03-04 16:26:48,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:26:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-03-04 16:26:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-03-04 16:26:48,412 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:48,413 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-03-04 16:26:48,413 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:48,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:48,413 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 38 times [2019-03-04 16:26:48,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:48,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:48,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:48,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:48,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:50,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:50,017 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:26:50,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:50,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:50,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:50,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 99 conjunts are in the unsatisfiable core [2019-03-04 16:26:50,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:51,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:51,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50] total 76 [2019-03-04 16:26:51,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-03-04 16:26:51,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-03-04 16:26:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:26:51,808 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-03-04 16:26:58,115 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-03-04 16:26:58,445 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-03-04 16:26:58,782 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-03-04 16:26:59,003 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:26:59,210 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:26:59,414 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:27:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:01,690 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-03-04 16:27:01,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-03-04 16:27:01,690 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-03-04 16:27:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:01,692 INFO L225 Difference]: With dead ends: 364 [2019-03-04 16:27:01,692 INFO L226 Difference]: Without dead ends: 270 [2019-03-04 16:27:01,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:27:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-03-04 16:27:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-03-04 16:27:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-03-04 16:27:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-03-04 16:27:01,721 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-03-04 16:27:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:01,721 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-03-04 16:27:01,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-03-04 16:27:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-03-04 16:27:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-03-04 16:27:01,722 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:01,722 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-03-04 16:27:01,722 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:01,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 39 times [2019-03-04 16:27:01,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:01,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:01,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:01,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:01,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:02,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:02,708 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:27:02,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:02,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-03-04 16:27:02,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:02,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 52 conjunts are in the unsatisfiable core [2019-03-04 16:27:02,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:03,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:03,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 76 [2019-03-04 16:27:03,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-03-04 16:27:03,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-03-04 16:27:03,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:27:03,839 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-03-04 16:27:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:05,563 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-03-04 16:27:05,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-03-04 16:27:05,564 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-03-04 16:27:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:05,565 INFO L225 Difference]: With dead ends: 375 [2019-03-04 16:27:05,565 INFO L226 Difference]: Without dead ends: 180 [2019-03-04 16:27:05,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-03-04 16:27:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-03-04 16:27:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-03-04 16:27:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-03-04 16:27:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-03-04 16:27:05,596 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-03-04 16:27:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:05,596 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-03-04 16:27:05,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-03-04 16:27:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-03-04 16:27:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-03-04 16:27:05,597 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:05,597 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-03-04 16:27:05,597 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 40 times [2019-03-04 16:27:05,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:05,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:05,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:05,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:05,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:07,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:07,548 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:27:07,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:27:07,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:27:07,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:07,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 16:27:07,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:09,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:09,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52] total 79 [2019-03-04 16:27:09,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:27:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:27:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:27:09,134 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-03-04 16:27:15,429 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-03-04 16:27:15,787 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-03-04 16:27:16,122 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-03-04 16:27:16,359 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:27:16,583 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:27:16,818 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:27:17,091 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:27:17,309 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:27:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:19,389 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-03-04 16:27:19,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 16:27:19,389 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-03-04 16:27:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:19,391 INFO L225 Difference]: With dead ends: 379 [2019-03-04 16:27:19,391 INFO L226 Difference]: Without dead ends: 281 [2019-03-04 16:27:19,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-03-04 16:27:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-03-04 16:27:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-03-04 16:27:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-03-04 16:27:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-03-04 16:27:19,422 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-03-04 16:27:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:19,422 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-03-04 16:27:19,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:27:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-03-04 16:27:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-03-04 16:27:19,423 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:19,423 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-03-04 16:27:19,423 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:19,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:19,423 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 41 times [2019-03-04 16:27:19,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:19,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:19,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:19,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:19,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:20,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:20,766 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:27:20,774 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:27:20,819 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-03-04 16:27:20,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:20,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjunts are in the unsatisfiable core [2019-03-04 16:27:20,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:22,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:22,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 79 [2019-03-04 16:27:22,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:27:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:27:22,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:27:22,080 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-03-04 16:27:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:23,992 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-03-04 16:27:23,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-03-04 16:27:23,992 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-03-04 16:27:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:23,993 INFO L225 Difference]: With dead ends: 390 [2019-03-04 16:27:23,994 INFO L226 Difference]: Without dead ends: 187 [2019-03-04 16:27:23,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2225 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 16:27:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-03-04 16:27:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-03-04 16:27:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-03-04 16:27:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-03-04 16:27:24,030 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-03-04 16:27:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:24,030 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-03-04 16:27:24,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:27:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-03-04 16:27:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-03-04 16:27:24,031 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:24,031 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-03-04 16:27:24,031 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:24,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:24,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 42 times [2019-03-04 16:27:24,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:24,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:24,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:26,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:26,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 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:27:26,082 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:27:26,132 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-03-04 16:27:26,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:26,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 107 conjunts are in the unsatisfiable core [2019-03-04 16:27:26,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:28,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:28,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 82 [2019-03-04 16:27:28,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-03-04 16:27:28,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-03-04 16:27:28,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=6588, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:27:28,015 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 83 states. [2019-03-04 16:27:34,676 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-03-04 16:27:35,046 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-03-04 16:27:35,395 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-03-04 16:27:35,642 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:27:35,881 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:27:36,127 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:27:36,344 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:27:36,555 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:27:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:38,932 INFO L93 Difference]: Finished difference Result 394 states and 399 transitions. [2019-03-04 16:27:38,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-03-04 16:27:38,932 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 184 [2019-03-04 16:27:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:38,934 INFO L225 Difference]: With dead ends: 394 [2019-03-04 16:27:38,934 INFO L226 Difference]: Without dead ends: 292 [2019-03-04 16:27:38,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2813 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1129, Invalid=16961, Unknown=0, NotChecked=0, Total=18090 [2019-03-04 16:27:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-03-04 16:27:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 189. [2019-03-04 16:27:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-03-04 16:27:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 191 transitions. [2019-03-04 16:27:38,968 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 191 transitions. Word has length 184 [2019-03-04 16:27:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:38,969 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 191 transitions. [2019-03-04 16:27:38,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-03-04 16:27:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 191 transitions. [2019-03-04 16:27:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-03-04 16:27:38,969 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:38,969 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1] [2019-03-04 16:27:38,970 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:38,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1293219048, now seen corresponding path program 43 times [2019-03-04 16:27:38,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:38,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:38,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:38,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:38,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 1378 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:40,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:40,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:40,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:40,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 56 conjunts are in the unsatisfiable core [2019-03-04 16:27:40,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 1378 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:41,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:41,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 82 [2019-03-04 16:27:41,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-03-04 16:27:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-03-04 16:27:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1594, Invalid=5212, Unknown=0, NotChecked=0, Total=6806 [2019-03-04 16:27:41,761 INFO L87 Difference]: Start difference. First operand 189 states and 191 transitions. Second operand 83 states. [2019-03-04 16:27:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:43,947 INFO L93 Difference]: Finished difference Result 405 states and 409 transitions. [2019-03-04 16:27:43,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-03-04 16:27:43,947 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 188 [2019-03-04 16:27:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:43,949 INFO L225 Difference]: With dead ends: 405 [2019-03-04 16:27:43,949 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:27:43,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2782, Invalid=9208, Unknown=0, NotChecked=0, Total=11990 [2019-03-04 16:27:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:27:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2019-03-04 16:27:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-03-04 16:27:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-03-04 16:27:43,982 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 188 [2019-03-04 16:27:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:43,982 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-03-04 16:27:43,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-03-04 16:27:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-03-04 16:27:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-03-04 16:27:43,983 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:43,983 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-03-04 16:27:43,983 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 44 times [2019-03-04 16:27:43,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:43,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:43,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:43,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:43,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:45,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:45,844 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:27:45,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:45,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:45,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:45,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 60 conjunts are in the unsatisfiable core [2019-03-04 16:27:45,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 1352 proven. 1106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:50,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:50,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 58] total 114 [2019-03-04 16:27:50,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-03-04 16:27:50,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-03-04 16:27:50,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1365, Invalid=11745, Unknown=0, NotChecked=0, Total=13110 [2019-03-04 16:27:50,427 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 115 states. [2019-03-04 16:28:06,228 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-03-04 16:28:06,626 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-03-04 16:28:07,046 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-03-04 16:28:07,387 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:28:07,718 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:28:08,026 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:28:08,329 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:28:08,623 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:28:08,908 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:28:11,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:11,837 INFO L93 Difference]: Finished difference Result 515 states and 521 transitions. [2019-03-04 16:28:11,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2019-03-04 16:28:11,837 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 191 [2019-03-04 16:28:11,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:11,839 INFO L225 Difference]: With dead ends: 515 [2019-03-04 16:28:11,839 INFO L226 Difference]: Without dead ends: 300 [2019-03-04 16:28:11,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17131 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=4879, Invalid=71573, Unknown=0, NotChecked=0, Total=76452 [2019-03-04 16:28:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-03-04 16:28:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 199. [2019-03-04 16:28:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-03-04 16:28:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-03-04 16:28:11,876 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 191 [2019-03-04 16:28:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:11,876 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-03-04 16:28:11,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-03-04 16:28:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-03-04 16:28:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-03-04 16:28:11,876 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:11,877 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-03-04 16:28:11,877 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 45 times [2019-03-04 16:28:11,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:11,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:11,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:13,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:13,840 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:28:13,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:28:13,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-03-04 16:28:13,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:13,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 115 conjunts are in the unsatisfiable core [2019-03-04 16:28:13,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:15,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:15,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58] total 88 [2019-03-04 16:28:15,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-03-04 16:28:15,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-03-04 16:28:15,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:28:15,839 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-03-04 16:28:23,532 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-03-04 16:28:23,927 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-03-04 16:28:24,317 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-03-04 16:28:24,607 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:28:24,874 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:28:25,136 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:28:25,383 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:28:25,620 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:28:25,852 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:28:26,072 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:28:26,504 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-03-04 16:28:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:28,612 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-03-04 16:28:28,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-03-04 16:28:28,612 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-03-04 16:28:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:28,613 INFO L225 Difference]: With dead ends: 424 [2019-03-04 16:28:28,613 INFO L226 Difference]: Without dead ends: 314 [2019-03-04 16:28:28,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3253 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-03-04 16:28:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-03-04 16:28:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-03-04 16:28:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-03-04 16:28:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-03-04 16:28:28,672 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-03-04 16:28:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:28,673 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-03-04 16:28:28,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-03-04 16:28:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-03-04 16:28:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-03-04 16:28:28,675 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:28,675 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-03-04 16:28:28,675 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 46 times [2019-03-04 16:28:28,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:28,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:28,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:29,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:29,844 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:28:29,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:28:29,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:28:29,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:29,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 60 conjunts are in the unsatisfiable core [2019-03-04 16:28:29,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:31,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:31,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 88 [2019-03-04 16:28:31,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-03-04 16:28:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-03-04 16:28:31,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:28:31,299 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-03-04 16:28:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:33,679 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-03-04 16:28:33,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-03-04 16:28:33,679 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-03-04 16:28:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:33,680 INFO L225 Difference]: With dead ends: 435 [2019-03-04 16:28:33,681 INFO L226 Difference]: Without dead ends: 208 [2019-03-04 16:28:33,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-03-04 16:28:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-03-04 16:28:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-03-04 16:28:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-03-04 16:28:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-03-04 16:28:33,726 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-03-04 16:28:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:33,726 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-03-04 16:28:33,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-03-04 16:28:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-03-04 16:28:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-03-04 16:28:33,727 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:33,727 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-03-04 16:28:33,727 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:33,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 47 times [2019-03-04 16:28:33,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:33,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:33,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:33,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:33,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:35,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:35,823 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:28:35,832 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:28:35,882 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-03-04 16:28:35,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:35,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 119 conjunts are in the unsatisfiable core [2019-03-04 16:28:35,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:37,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:37,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60] total 91 [2019-03-04 16:28:37,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:28:37,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:28:37,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:28:37,935 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-03-04 16:28:47,450 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-03-04 16:28:47,872 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-03-04 16:28:48,285 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-03-04 16:28:48,572 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:28:48,851 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:28:49,133 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:28:49,417 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:28:49,667 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:28:49,927 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:28:50,160 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:28:50,390 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:28:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:52,950 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-03-04 16:28:52,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-03-04 16:28:52,950 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-03-04 16:28:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:52,952 INFO L225 Difference]: With dead ends: 439 [2019-03-04 16:28:52,952 INFO L226 Difference]: Without dead ends: 325 [2019-03-04 16:28:52,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:28:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-03-04 16:28:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-03-04 16:28:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-03-04 16:28:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-03-04 16:28:52,996 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-03-04 16:28:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:52,996 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-03-04 16:28:52,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:28:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-03-04 16:28:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-03-04 16:28:52,998 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:52,998 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-03-04 16:28:52,998 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 48 times [2019-03-04 16:28:52,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:52,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:52,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:52,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:52,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:54,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:54,133 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:28:54,159 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:28:54,266 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2019-03-04 16:28:54,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:54,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 62 conjunts are in the unsatisfiable core [2019-03-04 16:28:54,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:28:55,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:55,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 91 [2019-03-04 16:28:55,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:28:55,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:28:55,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:28:55,665 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-03-04 16:28:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:58,102 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-03-04 16:28:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-03-04 16:28:58,102 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-03-04 16:28:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:58,104 INFO L225 Difference]: With dead ends: 450 [2019-03-04 16:28:58,104 INFO L226 Difference]: Without dead ends: 215 [2019-03-04 16:28:58,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2987 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:28:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-03-04 16:28:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-03-04 16:28:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-03-04 16:28:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-03-04 16:28:58,150 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-03-04 16:28:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:58,150 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-03-04 16:28:58,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:28:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-03-04 16:28:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-03-04 16:28:58,151 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:58,151 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-03-04 16:28:58,151 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 49 times [2019-03-04 16:28:58,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:58,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:58,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:58,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:58,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:00,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:00,263 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:29:00,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:00,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 123 conjunts are in the unsatisfiable core [2019-03-04 16:29:00,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:02,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:02,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62] total 94 [2019-03-04 16:29:02,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-03-04 16:29:02,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-03-04 16:29:02,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:29:02,700 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-03-04 16:29:11,896 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-03-04 16:29:12,332 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-03-04 16:29:12,762 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-03-04 16:29:13,066 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:29:13,384 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:29:13,669 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:29:13,948 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:29:14,227 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:29:14,486 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:29:14,742 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:29:14,988 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:29:15,222 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:29:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:17,859 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-03-04 16:29:17,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-03-04 16:29:17,859 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-03-04 16:29:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:17,861 INFO L225 Difference]: With dead ends: 454 [2019-03-04 16:29:17,861 INFO L226 Difference]: Without dead ends: 336 [2019-03-04 16:29:17,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3725 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:29:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-03-04 16:29:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-03-04 16:29:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:29:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-03-04 16:29:17,915 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-03-04 16:29:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:17,915 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-03-04 16:29:17,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-03-04 16:29:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-03-04 16:29:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-03-04 16:29:17,916 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:17,916 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-03-04 16:29:17,916 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 50 times [2019-03-04 16:29:17,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:17,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:17,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:19,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:19,190 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:29:19,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:29:19,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:29:19,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:19,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2019-03-04 16:29:19,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:20,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:20,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 94 [2019-03-04 16:29:20,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-03-04 16:29:20,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-03-04 16:29:20,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:29:20,732 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-03-04 16:29:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:23,358 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-03-04 16:29:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-03-04 16:29:23,358 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-03-04 16:29:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:23,359 INFO L225 Difference]: With dead ends: 465 [2019-03-04 16:29:23,359 INFO L226 Difference]: Without dead ends: 222 [2019-03-04 16:29:23,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3195 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-03-04 16:29:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-03-04 16:29:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-03-04 16:29:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-03-04 16:29:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-03-04 16:29:23,404 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-03-04 16:29:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:23,404 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-03-04 16:29:23,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-03-04 16:29:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-03-04 16:29:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-03-04 16:29:23,405 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:23,405 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-03-04 16:29:23,405 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 51 times [2019-03-04 16:29:23,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:23,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:23,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:23,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:25,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:25,569 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:29:25,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:29:25,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-03-04 16:29:25,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:29:25,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 68 conjunts are in the unsatisfiable core [2019-03-04 16:29:25,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:29:31,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:31,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66] total 130 [2019-03-04 16:29:31,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-03-04 16:29:31,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-03-04 16:29:31,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1751, Invalid=15279, Unknown=0, NotChecked=0, Total=17030 [2019-03-04 16:29:31,260 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-03-04 16:29:51,079 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-03-04 16:29:51,565 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-03-04 16:29:52,076 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-03-04 16:29:52,497 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:29:52,904 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:29:53,319 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:29:53,702 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:29:54,078 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:29:54,439 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:29:54,780 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:29:55,115 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:29:55,440 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:29:55,763 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:29:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:59,049 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-03-04 16:29:59,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-03-04 16:29:59,050 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-03-04 16:29:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:59,051 INFO L225 Difference]: With dead ends: 591 [2019-03-04 16:29:59,051 INFO L226 Difference]: Without dead ends: 344 [2019-03-04 16:29:59,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22519 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=6219, Invalid=93953, Unknown=0, NotChecked=0, Total=100172 [2019-03-04 16:29:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-03-04 16:29:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-03-04 16:29:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-03-04 16:29:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-03-04 16:29:59,097 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-03-04 16:29:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:59,097 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-03-04 16:29:59,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-03-04 16:29:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-03-04 16:29:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-03-04 16:29:59,098 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:59,098 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-03-04 16:29:59,098 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:59,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:59,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 52 times [2019-03-04 16:29:59,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:59,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:59,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:59,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:29:59,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:01,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:01,411 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:30:01,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:30:01,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:30:01,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:01,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 131 conjunts are in the unsatisfiable core [2019-03-04 16:30:01,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:05,230 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-03-04 16:30:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:06,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:06,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66] total 100 [2019-03-04 16:30:06,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-03-04 16:30:06,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-03-04 16:30:06,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:30:06,060 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-03-04 16:30:16,969 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-03-04 16:30:17,450 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-03-04 16:30:17,924 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-03-04 16:30:18,260 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:30:18,586 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:30:18,909 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:30:19,228 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:30:19,525 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:30:19,817 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:30:20,103 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:30:20,380 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:30:20,640 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:30:20,898 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:30:21,145 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:30:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:23,945 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-03-04 16:30:23,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-03-04 16:30:23,945 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-03-04 16:30:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:23,947 INFO L225 Difference]: With dead ends: 484 [2019-03-04 16:30:23,947 INFO L226 Difference]: Without dead ends: 358 [2019-03-04 16:30:23,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4229 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-03-04 16:30:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-03-04 16:30:23,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-03-04 16:30:23,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-03-04 16:30:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-03-04 16:30:23,994 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-03-04 16:30:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:23,994 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-03-04 16:30:23,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-03-04 16:30:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-03-04 16:30:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-03-04 16:30:23,996 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:23,996 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-03-04 16:30:23,996 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:23,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:23,996 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 53 times [2019-03-04 16:30:23,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:23,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:23,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:25,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:25,360 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:30:25,368 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:30:25,423 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-03-04 16:30:25,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:25,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2019-03-04 16:30:25,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:27,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:27,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 100 [2019-03-04 16:30:27,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-03-04 16:30:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-03-04 16:30:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 16:30:27,126 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-03-04 16:30:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:28,606 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-03-04 16:30:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-03-04 16:30:28,607 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-03-04 16:30:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:28,608 INFO L225 Difference]: With dead ends: 495 [2019-03-04 16:30:28,608 INFO L226 Difference]: Without dead ends: 236 [2019-03-04 16:30:28,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3632 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 16:30:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-03-04 16:30:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-03-04 16:30:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-03-04 16:30:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-03-04 16:30:28,669 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-03-04 16:30:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:28,670 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-03-04 16:30:28,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-03-04 16:30:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-03-04 16:30:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-03-04 16:30:28,671 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:28,671 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-03-04 16:30:28,671 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:28,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 54 times [2019-03-04 16:30:28,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:28,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:28,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:28,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:28,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:31,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:31,078 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:30:31,087 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:30:31,163 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-03-04 16:30:31,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:31,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 135 conjunts are in the unsatisfiable core [2019-03-04 16:30:31,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:33,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:33,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 68] total 103 [2019-03-04 16:30:33,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-03-04 16:30:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-03-04 16:30:33,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=10438, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:30:33,890 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 104 states. [2019-03-04 16:30:44,137 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-03-04 16:30:44,645 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-03-04 16:30:45,134 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-03-04 16:30:45,479 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:30:45,818 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:30:46,152 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:30:46,476 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:30:46,789 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:30:47,102 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:30:47,408 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:30:47,697 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:30:47,990 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:30:48,259 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:30:48,521 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:30:48,771 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:30:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:51,591 INFO L93 Difference]: Finished difference Result 499 states and 504 transitions. [2019-03-04 16:30:51,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-03-04 16:30:51,592 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 233 [2019-03-04 16:30:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:51,594 INFO L225 Difference]: With dead ends: 499 [2019-03-04 16:30:51,594 INFO L226 Difference]: Without dead ends: 369 [2019-03-04 16:30:51,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4493 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1661, Invalid=27069, Unknown=0, NotChecked=0, Total=28730 [2019-03-04 16:30:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-03-04 16:30:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 238. [2019-03-04 16:30:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-03-04 16:30:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 240 transitions. [2019-03-04 16:30:51,645 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 240 transitions. Word has length 233 [2019-03-04 16:30:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:51,645 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 240 transitions. [2019-03-04 16:30:51,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-03-04 16:30:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 240 transitions. [2019-03-04 16:30:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-03-04 16:30:51,646 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:51,647 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1] [2019-03-04 16:30:51,647 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:51,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1487711759, now seen corresponding path program 55 times [2019-03-04 16:30:51,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:51,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:51,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:51,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 2211 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:53,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:53,120 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:30:53,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:53,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 70 conjunts are in the unsatisfiable core [2019-03-04 16:30:53,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 2211 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:54,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:54,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 103 [2019-03-04 16:30:54,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-03-04 16:30:54,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-03-04 16:30:54,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2483, Invalid=8229, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:30:54,927 INFO L87 Difference]: Start difference. First operand 238 states and 240 transitions. Second operand 104 states. [2019-03-04 16:30:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:58,083 INFO L93 Difference]: Finished difference Result 510 states and 514 transitions. [2019-03-04 16:30:58,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-03-04 16:30:58,084 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 237 [2019-03-04 16:30:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:58,085 INFO L225 Difference]: With dead ends: 510 [2019-03-04 16:30:58,085 INFO L226 Difference]: Without dead ends: 243 [2019-03-04 16:30:58,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4336, Invalid=14570, Unknown=0, NotChecked=0, Total=18906 [2019-03-04 16:30:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-03-04 16:30:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-03-04 16:30:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-03-04 16:30:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-03-04 16:30:58,134 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 237 [2019-03-04 16:30:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:58,135 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-03-04 16:30:58,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-03-04 16:30:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-03-04 16:30:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-03-04 16:30:58,135 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:58,136 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-03-04 16:30:58,136 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:58,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:58,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 56 times [2019-03-04 16:30:58,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:58,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:58,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:58,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:58,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:00,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:00,706 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:31:00,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:31:00,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:31:00,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:00,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 74 conjunts are in the unsatisfiable core [2019-03-04 16:31:00,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2178 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:07,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:07,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 72] total 142 [2019-03-04 16:31:07,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-03-04 16:31:07,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-03-04 16:31:07,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=18234, Unknown=0, NotChecked=0, Total=20306 [2019-03-04 16:31:07,634 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 143 states. [2019-03-04 16:31:31,117 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-03-04 16:31:31,704 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-03-04 16:31:32,310 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-03-04 16:31:32,797 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:31:33,259 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:31:33,725 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:31:34,174 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:31:34,611 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:31:35,061 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:31:35,479 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:31:35,876 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:31:36,258 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:31:36,631 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:31:36,975 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:31:37,322 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:31:37,651 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:31:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:41,151 INFO L93 Difference]: Finished difference Result 648 states and 654 transitions. [2019-03-04 16:31:41,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2019-03-04 16:31:41,152 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 240 [2019-03-04 16:31:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:41,154 INFO L225 Difference]: With dead ends: 648 [2019-03-04 16:31:41,154 INFO L226 Difference]: Without dead ends: 377 [2019-03-04 16:31:41,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27043 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=7329, Invalid=112733, Unknown=0, NotChecked=0, Total=120062 [2019-03-04 16:31:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-03-04 16:31:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 248. [2019-03-04 16:31:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-03-04 16:31:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-03-04 16:31:41,211 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 240 [2019-03-04 16:31:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:41,211 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-03-04 16:31:41,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-03-04 16:31:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-03-04 16:31:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-03-04 16:31:41,212 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:41,212 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-03-04 16:31:41,212 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:41,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:41,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 57 times [2019-03-04 16:31:41,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:41,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:41,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:41,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:31:41,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:43,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:43,827 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:31:43,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:31:43,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-03-04 16:31:43,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:43,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 16:31:43,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:31:50,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:50,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74] total 146 [2019-03-04 16:31:50,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-03-04 16:31:50,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-03-04 16:31:50,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2185, Invalid=19277, Unknown=0, NotChecked=0, Total=21462 [2019-03-04 16:31:50,797 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-03-04 16:32:13,692 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-03-04 16:32:14,259 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-03-04 16:32:14,831 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-03-04 16:32:15,352 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:32:15,851 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:32:16,349 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:32:16,820 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:32:17,292 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:32:17,741 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:32:18,178 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:32:18,605 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:32:19,051 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:32:19,449 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:32:19,829 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:32:20,194 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:32:20,545 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:32:20,889 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:32:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:32:24,518 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-03-04 16:32:24,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-03-04 16:32:24,518 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-03-04 16:32:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:32:24,520 INFO L225 Difference]: With dead ends: 667 [2019-03-04 16:32:24,520 INFO L226 Difference]: Without dead ends: 388 [2019-03-04 16:32:24,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28643 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=7719, Invalid=119373, Unknown=0, NotChecked=0, Total=127092 [2019-03-04 16:32:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-03-04 16:32:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-03-04 16:32:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-03-04 16:32:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-03-04 16:32:24,585 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-03-04 16:32:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:32:24,585 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-03-04 16:32:24,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-03-04 16:32:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-03-04 16:32:24,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-03-04 16:32:24,587 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:32:24,587 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-03-04 16:32:24,587 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:32:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:32:24,587 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 58 times [2019-03-04 16:32:24,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:32:24,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:32:24,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:24,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:32:24,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:27,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:32:27,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:27,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:32:27,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:32:27,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:32:27,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 147 conjunts are in the unsatisfiable core [2019-03-04 16:32:27,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:32:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:30,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:32:30,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74] total 112 [2019-03-04 16:32:30,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-03-04 16:32:30,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-03-04 16:32:30,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:32:30,524 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-03-04 16:32:44,674 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-03-04 16:32:45,231 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-03-04 16:32:45,788 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-03-04 16:32:46,182 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 16:32:46,578 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:32:46,965 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:32:47,333 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:32:47,699 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:32:48,056 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:32:48,402 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:32:48,735 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:32:49,061 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:32:49,386 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:32:49,698 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:32:50,004 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:32:50,285 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:32:50,573 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:32:50,850 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:32:53,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:32:53,920 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-03-04 16:32:53,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-03-04 16:32:53,920 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-03-04 16:32:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:32:53,922 INFO L225 Difference]: With dead ends: 544 [2019-03-04 16:32:53,922 INFO L226 Difference]: Without dead ends: 402 [2019-03-04 16:32:53,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5333 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 16:32:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-03-04 16:32:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-03-04 16:32:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-03-04 16:32:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-03-04 16:32:53,983 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-03-04 16:32:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:32:53,983 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-03-04 16:32:53,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-03-04 16:32:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-03-04 16:32:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-03-04 16:32:53,984 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:32:53,984 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-03-04 16:32:53,984 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:32:53,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:32:53,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 59 times [2019-03-04 16:32:53,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:32:53,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:32:53,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:53,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:32:53,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:32:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:32:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:55,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:32:55,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:55,664 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:32:55,726 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-03-04 16:32:55,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:32:55,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 16:32:55,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:32:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:32:57,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:32:57,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 112 [2019-03-04 16:32:57,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-03-04 16:32:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-03-04 16:32:57,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 16:32:57,874 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-03-04 16:33:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:01,549 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-03-04 16:33:01,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-03-04 16:33:01,550 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-03-04 16:33:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:01,551 INFO L225 Difference]: With dead ends: 555 [2019-03-04 16:33:01,551 INFO L226 Difference]: Without dead ends: 264 [2019-03-04 16:33:01,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4590 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:33:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-03-04 16:33:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-03-04 16:33:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-03-04 16:33:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-03-04 16:33:01,613 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-03-04 16:33:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:01,613 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-03-04 16:33:01,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-03-04 16:33:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-03-04 16:33:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-03-04 16:33:01,614 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:01,614 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-03-04 16:33:01,614 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:33:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 60 times [2019-03-04 16:33:01,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:01,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:01,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:33:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:04,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:33:04,500 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:33:04,508 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:33:04,583 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2019-03-04 16:33:04,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:33:04,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 80 conjunts are in the unsatisfiable core [2019-03-04 16:33:04,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:33:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:12,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:12,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78] total 154 [2019-03-04 16:33:12,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-03-04 16:33:12,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-03-04 16:33:12,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2420, Invalid=21450, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:33:12,241 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-03-04 16:33:39,724 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-03-04 16:33:40,371 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-03-04 16:33:41,056 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-03-04 16:33:41,620 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-03-04 16:33:42,171 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 16:33:42,703 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:33:43,229 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:33:43,763 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:33:44,245 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:33:44,724 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:33:45,190 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:33:45,638 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:33:46,076 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:33:46,508 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:33:46,921 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:33:47,318 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:33:47,700 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:33:48,067 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:33:48,427 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:33:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:33:52,258 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-03-04 16:33:52,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-03-04 16:33:52,258 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-03-04 16:33:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:33:52,260 INFO L225 Difference]: With dead ends: 705 [2019-03-04 16:33:52,260 INFO L226 Difference]: Without dead ends: 410 [2019-03-04 16:33:52,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31981 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=8529, Invalid=133223, Unknown=0, NotChecked=0, Total=141752 [2019-03-04 16:33:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-03-04 16:33:52,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-03-04 16:33:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-03-04 16:33:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-03-04 16:33:52,334 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-03-04 16:33:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:33:52,334 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-03-04 16:33:52,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-03-04 16:33:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-03-04 16:33:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-03-04 16:33:52,336 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:33:52,336 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-03-04 16:33:52,336 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:33:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:33:52,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 61 times [2019-03-04 16:33:52,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:33:52,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:33:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:52,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:33:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:33:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:55,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:33:55,384 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:33:55,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:33:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:33:55,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 155 conjunts are in the unsatisfiable core [2019-03-04 16:33:55,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:33:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:33:58,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:33:58,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78] total 118 [2019-03-04 16:33:58,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-03-04 16:33:58,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-03-04 16:33:58,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:33:58,775 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-03-04 16:34:14,221 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-03-04 16:34:14,824 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-03-04 16:34:15,414 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-03-04 16:34:15,842 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-03-04 16:34:16,268 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-03-04 16:34:16,689 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 16:34:17,103 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:34:17,503 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:34:17,892 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:34:18,263 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:34:18,629 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:34:18,989 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:34:19,341 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:34:19,684 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:34:20,012 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:34:20,342 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:34:20,651 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:34:20,958 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:34:21,247 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:34:21,528 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:34:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:34:24,818 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-03-04 16:34:24,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-03-04 16:34:24,819 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-03-04 16:34:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:34:24,821 INFO L225 Difference]: With dead ends: 574 [2019-03-04 16:34:24,821 INFO L226 Difference]: Without dead ends: 424 [2019-03-04 16:34:24,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5933 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-03-04 16:34:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-03-04 16:34:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-03-04 16:34:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-03-04 16:34:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-03-04 16:34:24,889 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-03-04 16:34:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:34:24,889 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-03-04 16:34:24,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-03-04 16:34:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-03-04 16:34:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-03-04 16:34:24,891 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:34:24,891 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-03-04 16:34:24,891 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:34:24,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:34:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 62 times [2019-03-04 16:34:24,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:34:24,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:34:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:24,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:34:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:26,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:34:26,738 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:34:26,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:34:26,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:34:26,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:34:26,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 80 conjunts are in the unsatisfiable core [2019-03-04 16:34:26,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:34:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:29,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:34:29,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 118 [2019-03-04 16:34:29,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-03-04 16:34:29,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-03-04 16:34:29,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:34:29,133 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-03-04 16:34:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:34:32,182 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-03-04 16:34:32,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-03-04 16:34:32,182 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-03-04 16:34:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:34:32,184 INFO L225 Difference]: With dead ends: 585 [2019-03-04 16:34:32,184 INFO L226 Difference]: Without dead ends: 278 [2019-03-04 16:34:32,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5111 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 16:34:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-03-04 16:34:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-03-04 16:34:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-03-04 16:34:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-03-04 16:34:32,252 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-03-04 16:34:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:34:32,253 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-03-04 16:34:32,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-03-04 16:34:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-03-04 16:34:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-03-04 16:34:32,254 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:34:32,254 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-03-04 16:34:32,254 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:34:32,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:34:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 63 times [2019-03-04 16:34:32,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:34:32,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:34:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:32,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:34:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:34:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:34:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:35,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:34:35,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:34:35,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:34:35,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-03-04 16:34:35,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:34:35,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 84 conjunts are in the unsatisfiable core [2019-03-04 16:34:35,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:34:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:34:43,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:34:43,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82] total 162 [2019-03-04 16:34:43,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-03-04 16:34:43,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-03-04 16:34:43,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2667, Invalid=23739, Unknown=0, NotChecked=0, Total=26406 [2019-03-04 16:34:43,968 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 163 states. [2019-03-04 16:35:14,770 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2019-03-04 16:35:15,492 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2019-03-04 16:35:16,315 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-03-04 16:35:16,934 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-03-04 16:35:17,541 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-03-04 16:35:18,139 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-03-04 16:35:18,713 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 16:35:19,270 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:35:19,817 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:35:20,334 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:35:20,842 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:35:21,339 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:35:21,830 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:35:22,293 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:35:22,752 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:35:23,198 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:35:23,624 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:35:24,037 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:35:24,440 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:35:24,824 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:35:25,230 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:35:25,588 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:35:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:35:29,190 INFO L93 Difference]: Finished difference Result 743 states and 749 transitions. [2019-03-04 16:35:29,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 275 states. [2019-03-04 16:35:29,190 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 275 [2019-03-04 16:35:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:35:29,192 INFO L225 Difference]: With dead ends: 743 [2019-03-04 16:35:29,192 INFO L226 Difference]: Without dead ends: 432 [2019-03-04 16:35:29,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35503 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=9379, Invalid=147833, Unknown=0, NotChecked=0, Total=157212 [2019-03-04 16:35:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-03-04 16:35:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 283. [2019-03-04 16:35:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-03-04 16:35:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 285 transitions. [2019-03-04 16:35:29,277 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 285 transitions. Word has length 275 [2019-03-04 16:35:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:35:29,277 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 285 transitions. [2019-03-04 16:35:29,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-03-04 16:35:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 285 transitions. [2019-03-04 16:35:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-03-04 16:35:29,279 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:35:29,279 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 1, 1, 1, 1, 1] [2019-03-04 16:35:29,279 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:35:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:35:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1738639389, now seen corresponding path program 64 times [2019-03-04 16:35:29,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:35:29,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:35:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:29,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:35:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:35:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:35:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5461 backedges. 39 proven. 5422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:35:32,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:35:32,650 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:35:32,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:35:32,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:35:32,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:35:32,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 163 conjunts are in the unsatisfiable core [2019-03-04 16:35:32,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:35:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5461 backedges. 39 proven. 5422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:35:36,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:35:36,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 82] total 124 [2019-03-04 16:35:36,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-03-04 16:35:36,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-03-04 16:35:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=15170, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:35:36,368 INFO L87 Difference]: Start difference. First operand 283 states and 285 transitions. Second operand 125 states. [2019-03-04 16:35:52,948 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2019-03-04 16:35:53,616 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2019-03-04 16:35:54,270 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2019-03-04 16:35:54,745 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-03-04 16:35:55,204 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-03-04 16:35:55,655 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-03-04 16:35:56,092 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-03-04 16:35:56,531 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 16:35:56,952 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:35:57,373 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:35:57,780 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:35:58,166 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:35:58,558 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:35:58,933 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:35:59,298 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:35:59,650 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:35:59,995 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:36:00,334 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:36:00,664 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:36:00,973 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:36:01,277 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:36:01,608 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:36:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:04,993 INFO L93 Difference]: Finished difference Result 604 states and 609 transitions. [2019-03-04 16:36:04,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-03-04 16:36:04,993 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 282 [2019-03-04 16:36:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:04,995 INFO L225 Difference]: With dead ends: 604 [2019-03-04 16:36:04,996 INFO L226 Difference]: Without dead ends: 446 [2019-03-04 16:36:04,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6565 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=2291, Invalid=39529, Unknown=0, NotChecked=0, Total=41820 [2019-03-04 16:36:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-03-04 16:36:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 287. [2019-03-04 16:36:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-03-04 16:36:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 289 transitions. [2019-03-04 16:36:05,070 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 289 transitions. Word has length 282 [2019-03-04 16:36:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:05,070 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 289 transitions. [2019-03-04 16:36:05,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-03-04 16:36:05,071 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 289 transitions. [2019-03-04 16:36:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-03-04 16:36:05,071 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:05,072 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1] [2019-03-04 16:36:05,072 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:36:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1136141706, now seen corresponding path program 65 times [2019-03-04 16:36:05,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:05,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:36:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5620 backedges. 3240 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:36:07,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:36:07,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:36:07,095 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:36:07,171 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-03-04 16:36:07,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:36:07,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 84 conjunts are in the unsatisfiable core [2019-03-04 16:36:07,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:36:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5620 backedges. 3240 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:36:09,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:36:09,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 124 [2019-03-04 16:36:09,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-03-04 16:36:09,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-03-04 16:36:09,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3568, Invalid=11932, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:36:09,688 INFO L87 Difference]: Start difference. First operand 287 states and 289 transitions. Second operand 125 states. [2019-03-04 16:36:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:12,941 INFO L93 Difference]: Finished difference Result 615 states and 619 transitions. [2019-03-04 16:36:12,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-03-04 16:36:12,942 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 286 [2019-03-04 16:36:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:12,943 INFO L225 Difference]: With dead ends: 615 [2019-03-04 16:36:12,943 INFO L226 Difference]: Without dead ends: 292 [2019-03-04 16:36:12,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5660 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6233, Invalid=21157, Unknown=0, NotChecked=0, Total=27390 [2019-03-04 16:36:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-03-04 16:36:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2019-03-04 16:36:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-03-04 16:36:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 292 transitions. [2019-03-04 16:36:13,015 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 292 transitions. Word has length 286 [2019-03-04 16:36:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:13,015 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 292 transitions. [2019-03-04 16:36:13,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-03-04 16:36:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 292 transitions. [2019-03-04 16:36:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-03-04 16:36:13,016 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:13,017 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 1, 1, 1, 1, 1] [2019-03-04 16:36:13,017 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:36:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1263826174, now seen corresponding path program 66 times [2019-03-04 16:36:13,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:13,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:13,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:13,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:36:13,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:36:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5741 backedges. 40 proven. 5701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:36:16,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:36:16,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:36:16,539 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:36:16,626 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) [2019-03-04 16:36:16,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:36:16,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 167 conjunts are in the unsatisfiable core [2019-03-04 16:36:16,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:36:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5741 backedges. 40 proven. 5701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:36:20,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:36:20,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 84] total 127 [2019-03-04 16:36:20,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-03-04 16:36:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-03-04 16:36:20,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=15918, Unknown=0, NotChecked=0, Total=16256 [2019-03-04 16:36:20,449 INFO L87 Difference]: Start difference. First operand 290 states and 292 transitions. Second operand 128 states. [2019-03-04 16:36:37,927 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2019-03-04 16:36:38,593 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2019-03-04 16:36:39,257 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2019-03-04 16:36:39,757 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 199 [2019-03-04 16:36:40,229 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-03-04 16:36:40,696 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2019-03-04 16:36:41,162 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-03-04 16:36:41,612 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-03-04 16:36:42,058 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 16:36:42,486 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 16:36:42,899 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 16:36:43,303 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 16:36:43,703 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 16:36:44,093 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:36:44,474 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:36:44,844 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:36:45,213 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:36:45,587 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:36:45,930 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:36:46,265 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:36:46,585 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:36:46,892 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:36:47,188 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:36:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:36:50,658 INFO L93 Difference]: Finished difference Result 619 states and 624 transitions. [2019-03-04 16:36:50,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-03-04 16:36:50,659 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 289 [2019-03-04 16:36:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:36:50,661 INFO L225 Difference]: With dead ends: 619 [2019-03-04 16:36:50,661 INFO L226 Difference]: Without dead ends: 457 [2019-03-04 16:36:50,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6893 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=2389, Invalid=41501, Unknown=0, NotChecked=0, Total=43890 [2019-03-04 16:36:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-03-04 16:36:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 294. [2019-03-04 16:36:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-03-04 16:36:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 296 transitions. [2019-03-04 16:36:50,742 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 296 transitions. Word has length 289 [2019-03-04 16:36:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:36:50,742 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 296 transitions. [2019-03-04 16:36:50,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-03-04 16:36:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 296 transitions. [2019-03-04 16:36:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-03-04 16:36:50,743 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:36:50,743 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1] [2019-03-04 16:36:50,743 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:36:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:36:50,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2130219305, now seen corresponding path program 67 times [2019-03-04 16:36:50,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:36:50,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:36:50,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:50,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:36:50,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:36:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat