java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 08:54:43,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:54:43,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:54:43,474 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:54:43,474 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:54:43,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:54:43,477 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:54:43,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:54:43,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:54:43,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:54:43,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:54:43,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:54:43,483 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:54:43,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:54:43,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:54:43,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:54:43,487 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:54:43,490 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:54:43,494 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:54:43,496 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:54:43,497 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:54:43,501 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:54:43,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:54:43,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:54:43,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:54:43,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:54:43,509 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:54:43,511 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:54:43,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:54:43,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:54:43,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:54:43,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:54:43,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:54:43,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:54:43,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:54:43,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:54:43,519 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-03 08:54:43,543 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:54:43,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:54:43,544 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:54:43,544 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:54:43,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:54:43,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:54:43,546 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:54:43,546 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:54:43,546 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:54:43,546 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:54:43,546 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:54:43,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:54:43,547 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:54:43,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:54:43,547 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:54:43,547 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:54:43,547 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:54:43,548 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:54:43,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:54:43,548 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:54:43,548 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:54:43,548 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:54:43,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:54:43,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:54:43,549 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:54:43,549 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:54:43,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:54:43,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:54:43,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:54:43,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:54:43,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:54:43,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:54:43,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:54:43,625 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:54:43,625 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:54:43,626 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-10-03 08:54:43,626 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-10-03 08:54:43,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:54:43,704 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:54:43,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:54:43,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:54:43,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:54:43,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/1) ... [2018-10-03 08:54:43,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/1) ... [2018-10-03 08:54:43,754 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-03 08:54:43,754 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-03 08:54:43,755 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-03 08:54:43,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:54:43,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:54:43,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:54:43,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:54:43,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/1) ... [2018-10-03 08:54:43,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/1) ... [2018-10-03 08:54:43,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/1) ... [2018-10-03 08:54:43,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/1) ... [2018-10-03 08:54:43,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/1) ... [2018-10-03 08:54:43,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/1) ... [2018-10-03 08:54:43,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/1) ... [2018-10-03 08:54:43,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:54:43,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:54:43,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:54:43,798 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:54:43,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:54:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-03 08:54:43,877 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-03 08:54:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-10-03 08:54:44,107 INFO L337 CfgBuilder]: Using library mode [2018-10-03 08:54:44,108 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:54:44 BoogieIcfgContainer [2018-10-03 08:54:44,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:54:44,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:54:44,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:54:44,113 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:54:44,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:43" (1/2) ... [2018-10-03 08:54:44,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d640b4 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 08:54:44, skipping insertion in model container [2018-10-03 08:54:44,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:54:44" (2/2) ... [2018-10-03 08:54:44,117 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-10-03 08:54:44,127 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:54:44,135 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 08:54:44,227 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:54:44,228 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:54:44,228 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:54:44,228 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:54:44,229 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:54:44,229 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:54:44,230 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:54:44,230 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:54:44,230 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:54:44,266 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-10-03 08:54:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-03 08:54:44,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:44,283 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-03 08:54:44,284 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:44,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-10-03 08:54:44,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:44,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:44,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:44,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:54:44,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:44,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:54:44,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-03 08:54:44,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:54:44,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:54:44,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:54:44,536 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-10-03 08:54:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:44,601 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-10-03 08:54:44,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:54:44,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-03 08:54:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:44,616 INFO L225 Difference]: With dead ends: 17 [2018-10-03 08:54:44,616 INFO L226 Difference]: Without dead ends: 10 [2018-10-03 08:54:44,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:54:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-03 08:54:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-10-03 08:54:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-03 08:54:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-03 08:54:44,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-10-03 08:54:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:44,657 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-03 08:54:44,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:54:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-03 08:54:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 08:54:44,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:44,658 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-03 08:54:44,658 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:44,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:44,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-10-03 08:54:44,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:44,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:44,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:44,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:54:44,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:44,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:44,775 INFO L227 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 [2018-10-03 08:54:44,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:54:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:44,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:44,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:44,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:44,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:44,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:45,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:45,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-10-03 08:54:45,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 08:54:45,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 08:54:45,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-03 08:54:45,005 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-10-03 08:54:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:45,117 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-03 08:54:45,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 08:54:45,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-03 08:54:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:45,118 INFO L225 Difference]: With dead ends: 15 [2018-10-03 08:54:45,118 INFO L226 Difference]: Without dead ends: 14 [2018-10-03 08:54:45,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-03 08:54:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-03 08:54:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-10-03 08:54:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-03 08:54:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-03 08:54:45,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-10-03 08:54:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:45,124 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-03 08:54:45,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 08:54:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-03 08:54:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 08:54:45,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:45,126 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-10-03 08:54:45,126 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:45,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:45,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-10-03 08:54:45,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:45,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:45,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:45,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:54:45,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:45,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:45,321 INFO L227 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 [2018-10-03 08:54:45,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:54:45,375 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:54:45,375 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:45,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:45,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:45,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:45,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:45,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:45,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:45,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-10-03 08:54:45,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:54:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:54:45,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:54:45,677 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-10-03 08:54:45,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:45,732 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-03 08:54:45,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:54:45,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-03 08:54:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:45,734 INFO L225 Difference]: With dead ends: 19 [2018-10-03 08:54:45,735 INFO L226 Difference]: Without dead ends: 18 [2018-10-03 08:54:45,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:54:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-03 08:54:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-03 08:54:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-03 08:54:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-03 08:54:45,742 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-10-03 08:54:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:45,742 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-03 08:54:45,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:54:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-03 08:54:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:54:45,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:45,743 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-10-03 08:54:45,744 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:45,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:45,744 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-10-03 08:54:45,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:45,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:45,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:45,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:45,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:45,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:45,852 INFO L227 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 [2018-10-03 08:54:45,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:54:45,897 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-03 08:54:45,897 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:45,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:45,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:45,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:45,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:45,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:46,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:46,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-03 08:54:46,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-03 08:54:46,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-03 08:54:46,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-03 08:54:46,065 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-10-03 08:54:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:46,137 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-03 08:54:46,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 08:54:46,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-10-03 08:54:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:46,138 INFO L225 Difference]: With dead ends: 23 [2018-10-03 08:54:46,138 INFO L226 Difference]: Without dead ends: 22 [2018-10-03 08:54:46,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-03 08:54:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-03 08:54:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-03 08:54:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-03 08:54:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-03 08:54:46,144 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-10-03 08:54:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:46,145 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-03 08:54:46,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-03 08:54:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-03 08:54:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-03 08:54:46,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:46,146 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-10-03 08:54:46,146 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:46,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:46,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-10-03 08:54:46,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:46,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:46,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:46,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:46,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:46,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:46,344 INFO L227 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 [2018-10-03 08:54:46,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:54:46,374 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:54:46,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:46,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:46,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:46,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:46,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:46,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:46,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:46,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-10-03 08:54:46,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-03 08:54:46,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-03 08:54:46,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-03 08:54:46,880 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-10-03 08:54:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:46,961 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-03 08:54:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-03 08:54:46,961 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-10-03 08:54:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:46,962 INFO L225 Difference]: With dead ends: 27 [2018-10-03 08:54:46,963 INFO L226 Difference]: Without dead ends: 26 [2018-10-03 08:54:46,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-03 08:54:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-03 08:54:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-03 08:54:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-03 08:54:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-03 08:54:46,969 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-10-03 08:54:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:46,969 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-03 08:54:46,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-03 08:54:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-03 08:54:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-03 08:54:46,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:46,971 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-10-03 08:54:46,971 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:46,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:46,971 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-10-03 08:54:46,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:46,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:46,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:46,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:46,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:47,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:47,138 INFO L227 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 [2018-10-03 08:54:47,147 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:54:47,163 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-03 08:54:47,164 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:47,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:47,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:47,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:47,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:47,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:47,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:47,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-03 08:54:47,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 08:54:47,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 08:54:47,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:54:47,331 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-10-03 08:54:47,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:47,390 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-03 08:54:47,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-03 08:54:47,391 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-10-03 08:54:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:47,392 INFO L225 Difference]: With dead ends: 31 [2018-10-03 08:54:47,393 INFO L226 Difference]: Without dead ends: 30 [2018-10-03 08:54:47,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:54:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-03 08:54:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-03 08:54:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-03 08:54:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-03 08:54:47,399 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-10-03 08:54:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:47,399 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-03 08:54:47,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 08:54:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-03 08:54:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-03 08:54:47,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:47,400 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-10-03 08:54:47,401 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:47,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-10-03 08:54:47,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:47,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:47,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:47,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:47,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:47,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:47,665 INFO L227 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 [2018-10-03 08:54:47,679 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:54:47,698 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-03 08:54:47,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:47,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:47,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:47,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:47,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:47,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:47,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:47,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-03 08:54:47,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 08:54:47,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 08:54:47,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:54:47,922 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-10-03 08:54:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:48,022 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-03 08:54:48,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 08:54:48,022 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-10-03 08:54:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:48,024 INFO L225 Difference]: With dead ends: 35 [2018-10-03 08:54:48,024 INFO L226 Difference]: Without dead ends: 34 [2018-10-03 08:54:48,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:54:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-03 08:54:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-03 08:54:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-03 08:54:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-03 08:54:48,031 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-10-03 08:54:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:48,032 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-03 08:54:48,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 08:54:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-03 08:54:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-03 08:54:48,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:48,033 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-10-03 08:54:48,033 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:48,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:48,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-10-03 08:54:48,034 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:48,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:48,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:48,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:48,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:48,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:48,200 INFO L227 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 [2018-10-03 08:54:48,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:54:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:48,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:48,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:48,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:48,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:48,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:48,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:48,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-03 08:54:48,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 08:54:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 08:54:48,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:54:48,448 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-10-03 08:54:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:48,574 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-03 08:54:48,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-03 08:54:48,575 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-10-03 08:54:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:48,576 INFO L225 Difference]: With dead ends: 39 [2018-10-03 08:54:48,576 INFO L226 Difference]: Without dead ends: 38 [2018-10-03 08:54:48,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:54:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-03 08:54:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-03 08:54:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-03 08:54:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-03 08:54:48,582 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-10-03 08:54:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:48,583 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-03 08:54:48,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 08:54:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-03 08:54:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-03 08:54:48,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:48,584 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-10-03 08:54:48,585 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:48,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:48,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-10-03 08:54:48,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:48,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:48,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:54:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:48,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:48,757 INFO L227 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 [2018-10-03 08:54:48,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:54:48,790 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:54:48,791 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:48,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:48,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:48,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:48,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:48,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:49,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:49,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-10-03 08:54:49,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-03 08:54:49,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-03 08:54:49,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-03 08:54:49,051 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-10-03 08:54:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:49,322 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-03 08:54:49,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-03 08:54:49,322 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-10-03 08:54:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:49,323 INFO L225 Difference]: With dead ends: 43 [2018-10-03 08:54:49,323 INFO L226 Difference]: Without dead ends: 42 [2018-10-03 08:54:49,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-03 08:54:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-03 08:54:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-03 08:54:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-03 08:54:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-03 08:54:49,330 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-10-03 08:54:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:49,331 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-03 08:54:49,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-03 08:54:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-03 08:54:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-03 08:54:49,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:49,332 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-10-03 08:54:49,333 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:49,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:49,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-10-03 08:54:49,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:49,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:49,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:49,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:49,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:49,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:49,496 INFO L227 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 [2018-10-03 08:54:49,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:54:49,646 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-03 08:54:49,647 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:49,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:49,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:49,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:49,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:49,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:50,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:50,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-10-03 08:54:50,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-03 08:54:50,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-03 08:54:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:54:50,296 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-10-03 08:54:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:50,396 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-03 08:54:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-03 08:54:50,397 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-10-03 08:54:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:50,398 INFO L225 Difference]: With dead ends: 47 [2018-10-03 08:54:50,398 INFO L226 Difference]: Without dead ends: 46 [2018-10-03 08:54:50,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:54:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-03 08:54:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-03 08:54:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-03 08:54:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-03 08:54:50,405 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-10-03 08:54:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:50,406 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-03 08:54:50,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-03 08:54:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-03 08:54:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-03 08:54:50,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:50,407 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-10-03 08:54:50,408 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:50,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:50,408 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-10-03 08:54:50,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:50,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:50,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:50,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:50,689 INFO L227 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 [2018-10-03 08:54:50,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:54:50,725 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:54:50,725 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:50,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:50,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:50,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:50,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:50,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:51,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:51,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-10-03 08:54:51,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-03 08:54:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-03 08:54:51,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-03 08:54:51,186 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-10-03 08:54:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:51,314 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-03 08:54:51,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 08:54:51,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-10-03 08:54:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:51,317 INFO L225 Difference]: With dead ends: 51 [2018-10-03 08:54:51,317 INFO L226 Difference]: Without dead ends: 50 [2018-10-03 08:54:51,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-03 08:54:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-03 08:54:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-03 08:54:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-03 08:54:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-03 08:54:51,323 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-10-03 08:54:51,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:51,323 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-03 08:54:51,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-03 08:54:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-03 08:54:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-03 08:54:51,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:51,325 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-10-03 08:54:51,325 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:51,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-10-03 08:54:51,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:51,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:51,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:51,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:51,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:51,526 INFO L227 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 [2018-10-03 08:54:51,535 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:54:51,636 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-03 08:54:51,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:51,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:51,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:51,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:51,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:51,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:52,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:52,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-10-03 08:54:52,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-03 08:54:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-03 08:54:52,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:54:52,057 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-10-03 08:54:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:52,159 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-03 08:54:52,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-03 08:54:52,160 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-10-03 08:54:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:52,161 INFO L225 Difference]: With dead ends: 55 [2018-10-03 08:54:52,161 INFO L226 Difference]: Without dead ends: 54 [2018-10-03 08:54:52,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:54:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-03 08:54:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-03 08:54:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-03 08:54:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-03 08:54:52,168 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-10-03 08:54:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:52,168 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-03 08:54:52,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-03 08:54:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-03 08:54:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-03 08:54:52,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:52,169 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-10-03 08:54:52,169 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:52,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:52,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-10-03 08:54:52,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:52,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:52,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:52,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:52,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:52,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:52,676 INFO L227 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 [2018-10-03 08:54:52,684 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:54:52,715 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-03 08:54:52,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:52,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:52,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:52,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:52,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:52,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:53,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:53,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-10-03 08:54:53,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-03 08:54:53,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-03 08:54:53,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-03 08:54:53,022 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-10-03 08:54:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:53,334 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-03 08:54:53,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-03 08:54:53,334 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-10-03 08:54:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:53,335 INFO L225 Difference]: With dead ends: 59 [2018-10-03 08:54:53,335 INFO L226 Difference]: Without dead ends: 58 [2018-10-03 08:54:53,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-03 08:54:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-03 08:54:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-03 08:54:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-03 08:54:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-03 08:54:53,342 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-10-03 08:54:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:53,343 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-03 08:54:53,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-03 08:54:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-03 08:54:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-03 08:54:53,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:53,344 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-10-03 08:54:53,344 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:53,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:53,345 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-10-03 08:54:53,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:53,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:53,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:53,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:53,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:53,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:53,554 INFO L227 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 [2018-10-03 08:54:53,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:54:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:53,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:53,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:53,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:53,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:53,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:53,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:53,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-10-03 08:54:53,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-03 08:54:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-03 08:54:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-03 08:54:53,941 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-10-03 08:54:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:54,206 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-03 08:54:54,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-03 08:54:54,206 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-10-03 08:54:54,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:54,207 INFO L225 Difference]: With dead ends: 63 [2018-10-03 08:54:54,207 INFO L226 Difference]: Without dead ends: 62 [2018-10-03 08:54:54,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-03 08:54:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-03 08:54:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-03 08:54:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-03 08:54:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-03 08:54:54,214 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-10-03 08:54:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:54,214 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-03 08:54:54,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-03 08:54:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-03 08:54:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-03 08:54:54,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:54,215 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-10-03 08:54:54,216 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:54,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:54,216 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-10-03 08:54:54,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:54,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:54,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:54,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:54:54,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:54,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:54,930 INFO L227 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 [2018-10-03 08:54:54,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:54:54,973 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:54:54,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:54,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:54,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:54,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:55,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:55,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:55,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-10-03 08:54:55,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-03 08:54:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-03 08:54:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-03 08:54:55,332 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-10-03 08:54:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:55,457 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-03 08:54:55,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:54:55,457 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-10-03 08:54:55,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:55,458 INFO L225 Difference]: With dead ends: 67 [2018-10-03 08:54:55,458 INFO L226 Difference]: Without dead ends: 66 [2018-10-03 08:54:55,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-03 08:54:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-03 08:54:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-03 08:54:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-03 08:54:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-03 08:54:55,465 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-10-03 08:54:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:55,466 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-03 08:54:55,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-03 08:54:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-03 08:54:55,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-03 08:54:55,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:55,467 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-10-03 08:54:55,467 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:55,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:55,467 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-10-03 08:54:55,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:55,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:55,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:55,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:55,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:56,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:56,338 INFO L227 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 [2018-10-03 08:54:56,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:54:56,388 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-03 08:54:56,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:56,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:56,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:56,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:56,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:56,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:56,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:56,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-10-03 08:54:56,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-03 08:54:56,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-03 08:54:56,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:54:56,713 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-10-03 08:54:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:56,993 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-03 08:54:56,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-03 08:54:56,993 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-10-03 08:54:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:56,994 INFO L225 Difference]: With dead ends: 71 [2018-10-03 08:54:56,994 INFO L226 Difference]: Without dead ends: 70 [2018-10-03 08:54:56,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:54:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-03 08:54:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-03 08:54:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-03 08:54:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-03 08:54:57,004 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-10-03 08:54:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:57,004 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-03 08:54:57,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-03 08:54:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-03 08:54:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-03 08:54:57,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:57,006 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-10-03 08:54:57,006 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:57,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-10-03 08:54:57,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:57,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:57,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:57,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:57,376 INFO L227 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 [2018-10-03 08:54:57,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:54:57,407 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:54:57,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:57,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:57,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:57,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:57,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:57,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:57,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:57,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-10-03 08:54:57,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-03 08:54:57,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-03 08:54:57,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-03 08:54:57,839 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-10-03 08:54:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:57,952 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-03 08:54:57,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-03 08:54:57,953 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-10-03 08:54:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:57,954 INFO L225 Difference]: With dead ends: 75 [2018-10-03 08:54:57,954 INFO L226 Difference]: Without dead ends: 74 [2018-10-03 08:54:57,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-03 08:54:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-03 08:54:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-03 08:54:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-03 08:54:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-03 08:54:57,960 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-10-03 08:54:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:57,961 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-03 08:54:57,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-03 08:54:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-03 08:54:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-03 08:54:57,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:57,962 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-10-03 08:54:57,962 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:57,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:57,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-10-03 08:54:57,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:57,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:57,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:58,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:58,281 INFO L227 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 [2018-10-03 08:54:58,289 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:54:58,327 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-03 08:54:58,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:58,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:58,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:58,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:58,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:58,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:58,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:58,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-10-03 08:54:58,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-03 08:54:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-03 08:54:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-03 08:54:58,682 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-10-03 08:54:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:58,781 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-03 08:54:58,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-03 08:54:58,782 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-10-03 08:54:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:58,783 INFO L225 Difference]: With dead ends: 79 [2018-10-03 08:54:58,783 INFO L226 Difference]: Without dead ends: 78 [2018-10-03 08:54:58,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-03 08:54:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-03 08:54:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-03 08:54:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-03 08:54:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-03 08:54:58,788 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-10-03 08:54:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:58,788 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-03 08:54:58,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-03 08:54:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-03 08:54:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-03 08:54:58,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:58,790 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-10-03 08:54:58,790 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:58,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-10-03 08:54:58,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:58,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:58,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:58,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:58,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:54:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:59,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:54:59,163 INFO L227 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 [2018-10-03 08:54:59,170 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:54:59,214 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-03 08:54:59,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:54:59,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:54:59,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:54:59,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:54:59,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:54:59,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:54:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:54:59,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:54:59,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-10-03 08:54:59,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-03 08:54:59,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-03 08:54:59,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-03 08:54:59,720 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-10-03 08:54:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:54:59,858 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-03 08:54:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:54:59,858 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-10-03 08:54:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:54:59,859 INFO L225 Difference]: With dead ends: 83 [2018-10-03 08:54:59,859 INFO L226 Difference]: Without dead ends: 82 [2018-10-03 08:54:59,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-03 08:54:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-03 08:54:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-03 08:54:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-03 08:54:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-03 08:54:59,864 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-10-03 08:54:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:54:59,864 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-03 08:54:59,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-03 08:54:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-03 08:54:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-03 08:54:59,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:54:59,866 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-10-03 08:54:59,866 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:54:59,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:54:59,866 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-10-03 08:54:59,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:54:59,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:54:59,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:59,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:54:59,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:54:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:00,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:00,248 INFO L227 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 [2018-10-03 08:55:00,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:00,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:00,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:00,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:00,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:00,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:00,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:00,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-10-03 08:55:00,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-03 08:55:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-03 08:55:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-03 08:55:00,804 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-10-03 08:55:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:01,025 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-03 08:55:01,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-03 08:55:01,025 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-10-03 08:55:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:01,027 INFO L225 Difference]: With dead ends: 87 [2018-10-03 08:55:01,027 INFO L226 Difference]: Without dead ends: 86 [2018-10-03 08:55:01,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-03 08:55:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-03 08:55:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-03 08:55:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-03 08:55:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-03 08:55:01,032 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-10-03 08:55:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:01,033 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-03 08:55:01,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-03 08:55:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-03 08:55:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-03 08:55:01,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:01,034 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-10-03 08:55:01,034 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:01,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-10-03 08:55:01,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:01,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:01,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:01,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:01,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:01,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:01,733 INFO L227 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 [2018-10-03 08:55:01,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:55:01,771 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:55:01,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:01,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:01,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:01,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:01,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:01,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:02,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:02,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-10-03 08:55:02,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-03 08:55:02,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-03 08:55:02,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-03 08:55:02,167 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-10-03 08:55:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:02,328 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-03 08:55:02,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:55:02,329 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-10-03 08:55:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:02,330 INFO L225 Difference]: With dead ends: 91 [2018-10-03 08:55:02,330 INFO L226 Difference]: Without dead ends: 90 [2018-10-03 08:55:02,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-03 08:55:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-03 08:55:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-03 08:55:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-03 08:55:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-03 08:55:02,334 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-10-03 08:55:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:02,334 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-03 08:55:02,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-03 08:55:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-03 08:55:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-03 08:55:02,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:02,335 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-10-03 08:55:02,335 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:02,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:02,336 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-10-03 08:55:02,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:02,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:02,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:02,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:02,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:02,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:02,865 INFO L227 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 [2018-10-03 08:55:02,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:55:02,932 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-03 08:55:02,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:02,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:02,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:02,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:02,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:02,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:04,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:04,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-10-03 08:55:04,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-03 08:55:04,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-03 08:55:04,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-03 08:55:04,953 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-10-03 08:55:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:05,101 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-03 08:55:05,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:55:05,104 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-10-03 08:55:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:05,105 INFO L225 Difference]: With dead ends: 95 [2018-10-03 08:55:05,105 INFO L226 Difference]: Without dead ends: 94 [2018-10-03 08:55:05,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-03 08:55:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-03 08:55:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-03 08:55:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-03 08:55:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-03 08:55:05,109 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-10-03 08:55:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:05,110 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-03 08:55:05,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-03 08:55:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-03 08:55:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-03 08:55:05,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:05,111 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-10-03 08:55:05,111 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:05,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:05,111 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-10-03 08:55:05,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:05,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:05,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:05,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:05,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:05,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:05,459 INFO L227 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 [2018-10-03 08:55:05,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:55:05,503 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:55:05,504 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:05,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:05,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:05,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:05,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:05,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:06,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:06,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-10-03 08:55:06,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-03 08:55:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-03 08:55:06,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-03 08:55:06,051 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-10-03 08:55:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:06,211 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-03 08:55:06,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-03 08:55:06,211 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-10-03 08:55:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:06,212 INFO L225 Difference]: With dead ends: 99 [2018-10-03 08:55:06,213 INFO L226 Difference]: Without dead ends: 98 [2018-10-03 08:55:06,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-03 08:55:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-03 08:55:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-03 08:55:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-03 08:55:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-03 08:55:06,218 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-10-03 08:55:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:06,218 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-03 08:55:06,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-03 08:55:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-03 08:55:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-03 08:55:06,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:06,219 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-10-03 08:55:06,219 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:06,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-10-03 08:55:06,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:06,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:06,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:06,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:06,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:06,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:06,829 INFO L227 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 [2018-10-03 08:55:06,836 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:55:06,932 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-03 08:55:06,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:06,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:06,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:06,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:07,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:07,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:07,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:07,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-10-03 08:55:07,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-03 08:55:07,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-03 08:55:07,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-03 08:55:07,576 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-10-03 08:55:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:07,863 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-03 08:55:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-03 08:55:07,863 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-10-03 08:55:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:07,865 INFO L225 Difference]: With dead ends: 103 [2018-10-03 08:55:07,865 INFO L226 Difference]: Without dead ends: 102 [2018-10-03 08:55:07,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-03 08:55:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-03 08:55:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-10-03 08:55:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-03 08:55:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-03 08:55:07,872 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-10-03 08:55:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:07,872 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-03 08:55:07,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-03 08:55:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-03 08:55:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-03 08:55:07,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:07,873 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-10-03 08:55:07,873 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:07,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:07,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-10-03 08:55:07,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:07,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:07,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:07,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:07,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:08,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:08,406 INFO L227 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 [2018-10-03 08:55:08,414 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:55:08,514 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-03 08:55:08,514 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:08,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:08,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:08,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:08,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:08,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:09,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:09,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-10-03 08:55:09,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-03 08:55:09,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-03 08:55:09,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-03 08:55:09,038 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-10-03 08:55:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:09,234 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-03 08:55:09,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 08:55:09,235 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-10-03 08:55:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:09,235 INFO L225 Difference]: With dead ends: 107 [2018-10-03 08:55:09,235 INFO L226 Difference]: Without dead ends: 106 [2018-10-03 08:55:09,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-03 08:55:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-03 08:55:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-03 08:55:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-03 08:55:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-03 08:55:09,240 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-10-03 08:55:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:09,240 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-03 08:55:09,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-03 08:55:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-03 08:55:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-03 08:55:09,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:09,241 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-10-03 08:55:09,242 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:09,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:09,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-10-03 08:55:09,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:09,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:09,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:09,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:09,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:09,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:09,958 INFO L227 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 [2018-10-03 08:55:09,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:09,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:10,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:10,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:10,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:10,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:10,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:10,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-10-03 08:55:10,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-03 08:55:10,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-03 08:55:10,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-03 08:55:10,739 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-10-03 08:55:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:10,938 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-03 08:55:10,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-03 08:55:10,938 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-10-03 08:55:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:10,939 INFO L225 Difference]: With dead ends: 111 [2018-10-03 08:55:10,940 INFO L226 Difference]: Without dead ends: 110 [2018-10-03 08:55:10,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-03 08:55:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-03 08:55:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-03 08:55:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-03 08:55:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-03 08:55:10,945 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-10-03 08:55:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:10,946 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-03 08:55:10,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-03 08:55:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-03 08:55:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-03 08:55:10,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:10,946 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-10-03 08:55:10,946 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:10,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-10-03 08:55:10,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:10,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:10,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:10,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:10,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:11,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:11,615 INFO L227 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 [2018-10-03 08:55:11,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:55:11,662 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:55:11,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:11,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:11,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:11,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:11,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:11,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:12,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:12,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-10-03 08:55:12,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-03 08:55:12,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-03 08:55:12,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-03 08:55:12,330 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-10-03 08:55:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:12,517 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-03 08:55:12,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-03 08:55:12,517 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-10-03 08:55:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:12,518 INFO L225 Difference]: With dead ends: 115 [2018-10-03 08:55:12,518 INFO L226 Difference]: Without dead ends: 114 [2018-10-03 08:55:12,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-03 08:55:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-03 08:55:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-03 08:55:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-03 08:55:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-03 08:55:12,524 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-10-03 08:55:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:12,525 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-03 08:55:12,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-03 08:55:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-03 08:55:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-03 08:55:12,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:12,526 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-10-03 08:55:12,526 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:12,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:12,526 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-10-03 08:55:12,527 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:12,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:12,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:12,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:13,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:13,111 INFO L227 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 [2018-10-03 08:55:13,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:55:13,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-03 08:55:13,196 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:13,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:13,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:13,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:13,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:13,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:13,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:13,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-10-03 08:55:13,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-03 08:55:13,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-03 08:55:13,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-03 08:55:13,811 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-10-03 08:55:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:14,018 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-03 08:55:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-03 08:55:14,018 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-10-03 08:55:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:14,019 INFO L225 Difference]: With dead ends: 119 [2018-10-03 08:55:14,019 INFO L226 Difference]: Without dead ends: 118 [2018-10-03 08:55:14,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-03 08:55:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-03 08:55:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-03 08:55:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-03 08:55:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-03 08:55:14,024 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-10-03 08:55:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:14,024 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-03 08:55:14,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-03 08:55:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-03 08:55:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-03 08:55:14,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:14,025 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-10-03 08:55:14,026 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:14,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:14,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-10-03 08:55:14,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:14,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:14,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:14,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:14,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:14,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:14,681 INFO L227 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 [2018-10-03 08:55:14,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:55:14,728 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:55:14,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:14,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:14,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:14,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:14,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:14,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:15,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:15,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-10-03 08:55:15,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-03 08:55:15,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-03 08:55:15,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-03 08:55:15,446 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-10-03 08:55:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:15,651 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-03 08:55:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-03 08:55:15,651 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-10-03 08:55:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:15,653 INFO L225 Difference]: With dead ends: 123 [2018-10-03 08:55:15,653 INFO L226 Difference]: Without dead ends: 122 [2018-10-03 08:55:15,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-03 08:55:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-03 08:55:15,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-03 08:55:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-03 08:55:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-03 08:55:15,659 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-10-03 08:55:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:15,659 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-03 08:55:15,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-03 08:55:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-03 08:55:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-03 08:55:15,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:15,660 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-10-03 08:55:15,660 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:15,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:15,661 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-10-03 08:55:15,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:15,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:15,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:15,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:15,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:16,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:16,274 INFO L227 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 [2018-10-03 08:55:16,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:55:16,362 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-03 08:55:16,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:16,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:16,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:16,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:16,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:16,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:17,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:17,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-10-03 08:55:17,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-03 08:55:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-03 08:55:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-03 08:55:17,287 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-10-03 08:55:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:17,578 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-03 08:55:17,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-03 08:55:17,578 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-10-03 08:55:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:17,580 INFO L225 Difference]: With dead ends: 127 [2018-10-03 08:55:17,580 INFO L226 Difference]: Without dead ends: 126 [2018-10-03 08:55:17,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-03 08:55:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-03 08:55:17,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-10-03 08:55:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-03 08:55:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-03 08:55:17,587 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-10-03 08:55:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:17,587 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-03 08:55:17,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-03 08:55:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-03 08:55:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-03 08:55:17,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:17,588 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-10-03 08:55:17,588 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:17,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-10-03 08:55:17,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:17,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:17,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:18,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:18,273 INFO L227 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 [2018-10-03 08:55:18,282 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:55:18,382 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-03 08:55:18,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:18,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:18,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:18,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:18,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:18,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:19,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:19,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-10-03 08:55:19,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-03 08:55:19,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-03 08:55:19,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-03 08:55:19,140 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-10-03 08:55:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:19,344 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-03 08:55:19,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-03 08:55:19,345 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-10-03 08:55:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:19,346 INFO L225 Difference]: With dead ends: 131 [2018-10-03 08:55:19,346 INFO L226 Difference]: Without dead ends: 130 [2018-10-03 08:55:19,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-03 08:55:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-03 08:55:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-03 08:55:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-03 08:55:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-03 08:55:19,351 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-10-03 08:55:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:19,351 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-03 08:55:19,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-03 08:55:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-03 08:55:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-03 08:55:19,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:19,352 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-10-03 08:55:19,352 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:19,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:19,352 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-10-03 08:55:19,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:19,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:19,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:20,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:20,018 INFO L227 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 [2018-10-03 08:55:20,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:20,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:20,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:20,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:20,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:20,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:20,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:20,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-10-03 08:55:20,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-03 08:55:20,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-03 08:55:20,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-03 08:55:20,872 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-10-03 08:55:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:21,080 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-03 08:55:21,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-03 08:55:21,080 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-10-03 08:55:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:21,082 INFO L225 Difference]: With dead ends: 135 [2018-10-03 08:55:21,082 INFO L226 Difference]: Without dead ends: 134 [2018-10-03 08:55:21,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-03 08:55:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-03 08:55:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-03 08:55:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-03 08:55:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-03 08:55:21,088 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-10-03 08:55:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:21,088 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-03 08:55:21,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-03 08:55:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-03 08:55:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-03 08:55:21,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:21,089 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-10-03 08:55:21,089 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:21,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:21,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-10-03 08:55:21,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:21,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:21,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:21,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:21,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:22,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:22,312 INFO L227 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 [2018-10-03 08:55:22,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:55:22,369 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:55:22,369 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:22,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:22,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:22,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:22,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:22,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:23,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:23,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-10-03 08:55:23,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-03 08:55:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-03 08:55:23,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-03 08:55:23,171 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-10-03 08:55:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:23,412 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-03 08:55:23,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-03 08:55:23,412 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-10-03 08:55:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:23,414 INFO L225 Difference]: With dead ends: 139 [2018-10-03 08:55:23,414 INFO L226 Difference]: Without dead ends: 138 [2018-10-03 08:55:23,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-03 08:55:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-03 08:55:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-03 08:55:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-03 08:55:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-03 08:55:23,420 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-10-03 08:55:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:23,420 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-03 08:55:23,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-03 08:55:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-03 08:55:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-03 08:55:23,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:23,421 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-10-03 08:55:23,421 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:23,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:23,422 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-10-03 08:55:23,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:23,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:23,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:23,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:24,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:24,154 INFO L227 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 [2018-10-03 08:55:24,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:55:24,261 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-03 08:55:24,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:24,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:24,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:24,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:24,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:24,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:26,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:26,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-10-03 08:55:26,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-03 08:55:26,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-03 08:55:26,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-03 08:55:26,375 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-10-03 08:55:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:26,722 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-03 08:55:26,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-03 08:55:26,722 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-10-03 08:55:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:26,723 INFO L225 Difference]: With dead ends: 143 [2018-10-03 08:55:26,723 INFO L226 Difference]: Without dead ends: 142 [2018-10-03 08:55:26,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-03 08:55:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-03 08:55:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-03 08:55:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-03 08:55:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-03 08:55:26,728 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-10-03 08:55:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:26,728 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-03 08:55:26,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-03 08:55:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-03 08:55:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-03 08:55:26,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:26,729 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-10-03 08:55:26,730 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:26,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:26,730 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-10-03 08:55:26,730 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:26,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:26,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:26,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:26,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:27,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:27,566 INFO L227 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 [2018-10-03 08:55:27,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:55:27,618 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:55:27,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:27,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:27,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:27,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:27,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:27,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:28,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:28,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-10-03 08:55:28,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-03 08:55:28,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-03 08:55:28,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-03 08:55:28,659 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-10-03 08:55:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:29,064 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-03 08:55:29,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-03 08:55:29,064 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-10-03 08:55:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:29,066 INFO L225 Difference]: With dead ends: 147 [2018-10-03 08:55:29,066 INFO L226 Difference]: Without dead ends: 146 [2018-10-03 08:55:29,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-03 08:55:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-03 08:55:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-03 08:55:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-03 08:55:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-03 08:55:29,073 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-10-03 08:55:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:29,073 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-03 08:55:29,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-03 08:55:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-03 08:55:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-03 08:55:29,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:29,075 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-10-03 08:55:29,075 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:29,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:29,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-10-03 08:55:29,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:29,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:29,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:29,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:29,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:30,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:30,208 INFO L227 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 [2018-10-03 08:55:30,216 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:55:30,298 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-03 08:55:30,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:30,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:30,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:30,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:30,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:30,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:31,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:31,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-10-03 08:55:31,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-03 08:55:31,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-03 08:55:31,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-03 08:55:31,665 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-10-03 08:55:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:32,089 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-03 08:55:32,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-03 08:55:32,089 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-10-03 08:55:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:32,091 INFO L225 Difference]: With dead ends: 151 [2018-10-03 08:55:32,091 INFO L226 Difference]: Without dead ends: 150 [2018-10-03 08:55:32,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-03 08:55:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-03 08:55:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-10-03 08:55:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-03 08:55:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-03 08:55:32,097 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-10-03 08:55:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:32,097 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-03 08:55:32,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-03 08:55:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-03 08:55:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-03 08:55:32,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:32,098 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-10-03 08:55:32,098 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:32,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-10-03 08:55:32,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:32,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:32,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:32,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:32,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:33,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:33,307 INFO L227 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 [2018-10-03 08:55:33,314 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:55:33,430 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-03 08:55:33,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:33,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:33,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:33,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:33,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:33,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:34,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:34,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-10-03 08:55:34,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-03 08:55:34,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-03 08:55:34,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-03 08:55:34,388 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-10-03 08:55:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:34,682 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-03 08:55:34,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-03 08:55:34,683 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-10-03 08:55:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:34,684 INFO L225 Difference]: With dead ends: 155 [2018-10-03 08:55:34,685 INFO L226 Difference]: Without dead ends: 154 [2018-10-03 08:55:34,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-03 08:55:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-03 08:55:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-03 08:55:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-03 08:55:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-03 08:55:34,691 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-10-03 08:55:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:34,691 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-03 08:55:34,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-03 08:55:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-03 08:55:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-03 08:55:34,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:34,693 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-10-03 08:55:34,693 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:34,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:34,693 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-10-03 08:55:34,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:34,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:34,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:34,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:34,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:35,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:35,674 INFO L227 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 [2018-10-03 08:55:35,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:35,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:35,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:35,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:35,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:35,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:36,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:36,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-10-03 08:55:36,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-03 08:55:36,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-03 08:55:36,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-03 08:55:36,903 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-10-03 08:55:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:37,259 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-03 08:55:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-03 08:55:37,259 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-10-03 08:55:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:37,260 INFO L225 Difference]: With dead ends: 159 [2018-10-03 08:55:37,260 INFO L226 Difference]: Without dead ends: 158 [2018-10-03 08:55:37,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-03 08:55:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-03 08:55:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-03 08:55:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-03 08:55:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-03 08:55:37,265 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-10-03 08:55:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:37,266 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-03 08:55:37,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-03 08:55:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-03 08:55:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-03 08:55:37,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:37,267 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-10-03 08:55:37,267 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:37,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-10-03 08:55:37,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:37,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:37,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:37,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:37,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:38,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:38,371 INFO L227 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 [2018-10-03 08:55:38,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:55:38,427 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:55:38,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:38,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:38,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:38,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:38,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:38,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:39,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:39,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-10-03 08:55:39,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-03 08:55:39,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-03 08:55:39,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-03 08:55:39,513 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-10-03 08:55:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:39,835 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-03 08:55:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-03 08:55:39,835 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-10-03 08:55:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:39,837 INFO L225 Difference]: With dead ends: 163 [2018-10-03 08:55:39,837 INFO L226 Difference]: Without dead ends: 162 [2018-10-03 08:55:39,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-03 08:55:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-03 08:55:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-03 08:55:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-03 08:55:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-03 08:55:39,843 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-10-03 08:55:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:39,843 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-03 08:55:39,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-03 08:55:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-03 08:55:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-03 08:55:39,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:39,844 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-10-03 08:55:39,845 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:39,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:39,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-10-03 08:55:39,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:39,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:39,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:40,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:40,896 INFO L227 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 [2018-10-03 08:55:40,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:55:41,065 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-03 08:55:41,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:41,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:41,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:41,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:41,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:41,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:42,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:42,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-10-03 08:55:42,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-03 08:55:42,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-03 08:55:42,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-03 08:55:42,128 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-10-03 08:55:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:42,612 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-03 08:55:42,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-03 08:55:42,613 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-10-03 08:55:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:42,614 INFO L225 Difference]: With dead ends: 167 [2018-10-03 08:55:42,614 INFO L226 Difference]: Without dead ends: 166 [2018-10-03 08:55:42,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-03 08:55:42,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-03 08:55:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-03 08:55:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-03 08:55:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-03 08:55:42,619 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-10-03 08:55:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:42,620 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-03 08:55:42,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-03 08:55:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-03 08:55:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-03 08:55:42,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:42,621 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-10-03 08:55:42,621 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:42,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:42,621 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-10-03 08:55:42,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:42,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:42,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:42,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:42,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:43,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:43,673 INFO L227 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 [2018-10-03 08:55:43,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:55:43,732 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:55:43,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:43,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:43,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:43,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:43,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:43,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:44,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:44,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-10-03 08:55:44,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-03 08:55:44,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-03 08:55:44,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-03 08:55:44,991 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-10-03 08:55:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:45,250 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-03 08:55:45,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-03 08:55:45,250 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-10-03 08:55:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:45,252 INFO L225 Difference]: With dead ends: 171 [2018-10-03 08:55:45,252 INFO L226 Difference]: Without dead ends: 170 [2018-10-03 08:55:45,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-03 08:55:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-03 08:55:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-03 08:55:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-03 08:55:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-03 08:55:45,258 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-10-03 08:55:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:45,258 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-03 08:55:45,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-03 08:55:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-03 08:55:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-03 08:55:45,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:45,259 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-10-03 08:55:45,259 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:45,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:45,260 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-10-03 08:55:45,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:45,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:45,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:45,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:45,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:46,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:46,273 INFO L227 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 [2018-10-03 08:55:46,283 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:55:46,448 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-03 08:55:46,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:46,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:46,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:46,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:46,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:46,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:48,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:48,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-10-03 08:55:48,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-03 08:55:48,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-03 08:55:48,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-03 08:55:48,073 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-10-03 08:55:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:48,400 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-03 08:55:48,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-03 08:55:48,401 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-10-03 08:55:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:48,402 INFO L225 Difference]: With dead ends: 175 [2018-10-03 08:55:48,402 INFO L226 Difference]: Without dead ends: 174 [2018-10-03 08:55:48,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-03 08:55:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-03 08:55:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-03 08:55:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-03 08:55:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-03 08:55:48,408 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-10-03 08:55:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:48,409 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-03 08:55:48,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-03 08:55:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-03 08:55:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-03 08:55:48,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:48,410 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-10-03 08:55:48,410 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:48,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:48,410 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-10-03 08:55:48,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:48,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:48,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:48,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:48,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:49,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:49,440 INFO L227 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 [2018-10-03 08:55:49,454 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:55:49,654 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-03 08:55:49,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:49,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:49,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:49,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:49,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:49,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:50,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:50,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-10-03 08:55:50,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-03 08:55:50,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-03 08:55:50,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-03 08:55:50,889 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-10-03 08:55:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:51,516 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-03 08:55:51,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-03 08:55:51,516 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-10-03 08:55:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:51,518 INFO L225 Difference]: With dead ends: 179 [2018-10-03 08:55:51,518 INFO L226 Difference]: Without dead ends: 178 [2018-10-03 08:55:51,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-03 08:55:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-03 08:55:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-03 08:55:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-03 08:55:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-03 08:55:51,525 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-10-03 08:55:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:51,525 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-03 08:55:51,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-03 08:55:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-03 08:55:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-03 08:55:51,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:51,527 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-10-03 08:55:51,527 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:51,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:51,527 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-10-03 08:55:51,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:51,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:51,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:51,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:53,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:53,235 INFO L227 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 [2018-10-03 08:55:53,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:53,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:53,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:53,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:53,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:53,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:54,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:54,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-10-03 08:55:54,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-03 08:55:54,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-03 08:55:54,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-03 08:55:54,588 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-10-03 08:55:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:54,879 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-03 08:55:54,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-03 08:55:54,879 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-10-03 08:55:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:54,880 INFO L225 Difference]: With dead ends: 183 [2018-10-03 08:55:54,881 INFO L226 Difference]: Without dead ends: 182 [2018-10-03 08:55:54,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-03 08:55:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-03 08:55:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-03 08:55:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-03 08:55:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-03 08:55:54,886 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-10-03 08:55:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:54,887 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-03 08:55:54,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-03 08:55:54,887 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-03 08:55:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-03 08:55:54,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:54,888 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-10-03 08:55:54,888 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:54,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:54,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-10-03 08:55:54,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:54,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:54,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:54,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:54,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:56,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:56,160 INFO L227 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 [2018-10-03 08:55:56,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:55:56,218 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:55:56,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:56,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:56,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:56,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:56,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:56,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:57,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:57,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-10-03 08:55:57,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-03 08:55:57,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-03 08:55:57,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-03 08:55:57,864 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-10-03 08:55:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:58,148 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-03 08:55:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-03 08:55:58,148 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-10-03 08:55:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:58,150 INFO L225 Difference]: With dead ends: 187 [2018-10-03 08:55:58,150 INFO L226 Difference]: Without dead ends: 186 [2018-10-03 08:55:58,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-03 08:55:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-03 08:55:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-03 08:55:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-03 08:55:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-03 08:55:58,156 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-10-03 08:55:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:58,156 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-03 08:55:58,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-03 08:55:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-03 08:55:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-03 08:55:58,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:58,158 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-10-03 08:55:58,158 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:55:58,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-10-03 08:55:58,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:58,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:58,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:58,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:58,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:59,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:59,522 INFO L227 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 [2018-10-03 08:55:59,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:55:59,699 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-03 08:55:59,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:59,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:59,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:59,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:59,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:59,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:01,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:01,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-10-03 08:56:01,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-03 08:56:01,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-03 08:56:01,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-03 08:56:01,080 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-10-03 08:56:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:01,397 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-03 08:56:01,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-03 08:56:01,398 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-10-03 08:56:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:01,399 INFO L225 Difference]: With dead ends: 191 [2018-10-03 08:56:01,399 INFO L226 Difference]: Without dead ends: 190 [2018-10-03 08:56:01,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-03 08:56:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-03 08:56:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-10-03 08:56:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-03 08:56:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-03 08:56:01,406 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-10-03 08:56:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:01,406 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-03 08:56:01,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-03 08:56:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-03 08:56:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-03 08:56:01,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:01,407 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-10-03 08:56:01,407 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:01,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-10-03 08:56:01,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:01,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:01,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:01,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:01,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:03,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:03,348 INFO L227 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 [2018-10-03 08:56:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:56:03,423 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:56:03,423 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:03,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:03,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:03,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:03,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:03,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:05,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:05,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-10-03 08:56:05,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-03 08:56:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-03 08:56:05,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-03 08:56:05,987 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-10-03 08:56:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:06,454 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-03 08:56:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-03 08:56:06,454 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-10-03 08:56:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:06,456 INFO L225 Difference]: With dead ends: 195 [2018-10-03 08:56:06,456 INFO L226 Difference]: Without dead ends: 194 [2018-10-03 08:56:06,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-03 08:56:06,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-03 08:56:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-10-03 08:56:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-03 08:56:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-03 08:56:06,461 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-10-03 08:56:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:06,461 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-03 08:56:06,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-03 08:56:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-03 08:56:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-03 08:56:06,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:06,462 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-10-03 08:56:06,462 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:06,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-10-03 08:56:06,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:06,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:06,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:06,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:06,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:08,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:08,580 INFO L227 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 [2018-10-03 08:56:08,587 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:56:08,729 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-03 08:56:08,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:08,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:08,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:08,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:08,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:08,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:10,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:10,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-10-03 08:56:10,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-03 08:56:10,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-03 08:56:10,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-03 08:56:10,295 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-10-03 08:56:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:10,632 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-03 08:56:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-03 08:56:10,632 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-10-03 08:56:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:10,634 INFO L225 Difference]: With dead ends: 199 [2018-10-03 08:56:10,634 INFO L226 Difference]: Without dead ends: 198 [2018-10-03 08:56:10,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-03 08:56:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-03 08:56:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-10-03 08:56:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-03 08:56:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-03 08:56:10,639 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-10-03 08:56:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:10,639 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-03 08:56:10,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-03 08:56:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-03 08:56:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-03 08:56:10,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:10,640 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-10-03 08:56:10,640 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:10,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:10,641 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-10-03 08:56:10,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:10,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:10,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:10,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:10,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:12,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:12,033 INFO L227 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 [2018-10-03 08:56:12,040 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:56:12,211 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-03 08:56:12,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:12,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:12,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:12,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:12,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:12,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:13,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:13,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-10-03 08:56:13,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-03 08:56:13,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-03 08:56:13,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-03 08:56:13,914 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-10-03 08:56:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:14,280 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-03 08:56:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-03 08:56:14,281 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-10-03 08:56:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:14,282 INFO L225 Difference]: With dead ends: 203 [2018-10-03 08:56:14,282 INFO L226 Difference]: Without dead ends: 202 [2018-10-03 08:56:14,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-03 08:56:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-03 08:56:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-10-03 08:56:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-03 08:56:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-03 08:56:14,288 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-10-03 08:56:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:14,288 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-03 08:56:14,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-03 08:56:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-03 08:56:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-03 08:56:14,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:14,289 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-10-03 08:56:14,289 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:14,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-10-03 08:56:14,290 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:14,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:14,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:14,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:14,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:15,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:15,701 INFO L227 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 [2018-10-03 08:56:15,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:56:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:15,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:15,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:15,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:15,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:15,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:17,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:17,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-10-03 08:56:17,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-03 08:56:17,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-03 08:56:17,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-03 08:56:17,426 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-10-03 08:56:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:17,749 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-03 08:56:17,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-03 08:56:17,749 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-10-03 08:56:17,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:17,751 INFO L225 Difference]: With dead ends: 207 [2018-10-03 08:56:17,751 INFO L226 Difference]: Without dead ends: 206 [2018-10-03 08:56:17,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-03 08:56:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-03 08:56:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-10-03 08:56:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-03 08:56:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-03 08:56:17,757 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-10-03 08:56:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:17,757 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-03 08:56:17,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-03 08:56:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-03 08:56:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-03 08:56:17,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:17,758 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-10-03 08:56:17,758 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:17,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:17,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-10-03 08:56:17,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:17,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:17,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:17,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:56:17,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:19,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:19,368 INFO L227 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 [2018-10-03 08:56:19,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:56:19,438 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:56:19,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:19,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:19,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:19,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:19,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:19,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:21,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:21,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-10-03 08:56:21,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-03 08:56:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-03 08:56:21,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-03 08:56:21,385 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-10-03 08:56:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:21,725 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-03 08:56:21,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-03 08:56:21,726 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-10-03 08:56:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:21,728 INFO L225 Difference]: With dead ends: 211 [2018-10-03 08:56:21,728 INFO L226 Difference]: Without dead ends: 210 [2018-10-03 08:56:21,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-03 08:56:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-03 08:56:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-10-03 08:56:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-03 08:56:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-03 08:56:21,734 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-10-03 08:56:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:21,734 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-03 08:56:21,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-03 08:56:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-03 08:56:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-03 08:56:21,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:21,736 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-10-03 08:56:21,736 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:21,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:21,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-10-03 08:56:21,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:21,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:21,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:21,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:21,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:23,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:23,461 INFO L227 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 [2018-10-03 08:56:23,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:56:23,840 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-03 08:56:23,841 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:23,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:23,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:23,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:23,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:23,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:25,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:25,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-10-03 08:56:25,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-03 08:56:25,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-03 08:56:25,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-03 08:56:25,608 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-10-03 08:56:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:25,971 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-03 08:56:25,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-03 08:56:25,972 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-10-03 08:56:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:25,974 INFO L225 Difference]: With dead ends: 215 [2018-10-03 08:56:25,974 INFO L226 Difference]: Without dead ends: 214 [2018-10-03 08:56:25,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-03 08:56:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-03 08:56:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-10-03 08:56:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-03 08:56:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-03 08:56:25,980 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-10-03 08:56:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:25,981 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-03 08:56:25,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-03 08:56:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-03 08:56:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-03 08:56:25,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:25,982 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-10-03 08:56:25,982 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:25,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:25,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-10-03 08:56:25,983 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:25,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:25,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:25,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:25,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:27,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:27,480 INFO L227 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 [2018-10-03 08:56:27,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:56:27,549 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:56:27,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:27,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:27,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:27,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:27,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:27,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:29,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:29,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-10-03 08:56:29,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-03 08:56:29,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-03 08:56:29,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-03 08:56:29,642 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-10-03 08:56:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:29,996 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-03 08:56:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-03 08:56:29,997 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-10-03 08:56:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:29,999 INFO L225 Difference]: With dead ends: 219 [2018-10-03 08:56:29,999 INFO L226 Difference]: Without dead ends: 218 [2018-10-03 08:56:30,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-03 08:56:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-03 08:56:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-10-03 08:56:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-03 08:56:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-03 08:56:30,004 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-10-03 08:56:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:30,004 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-03 08:56:30,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-03 08:56:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-03 08:56:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-03 08:56:30,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:30,005 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-10-03 08:56:30,006 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:30,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-10-03 08:56:30,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:30,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:30,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:30,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:30,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:31,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:31,590 INFO L227 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 [2018-10-03 08:56:31,597 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:56:31,742 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-03 08:56:31,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:31,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:31,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:31,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:31,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:31,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:33,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:33,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-10-03 08:56:33,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-03 08:56:33,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-03 08:56:33,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-03 08:56:33,793 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-10-03 08:56:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:34,164 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-03 08:56:34,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-03 08:56:34,165 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-10-03 08:56:34,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:34,166 INFO L225 Difference]: With dead ends: 223 [2018-10-03 08:56:34,166 INFO L226 Difference]: Without dead ends: 222 [2018-10-03 08:56:34,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-03 08:56:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-03 08:56:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-10-03 08:56:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-03 08:56:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-03 08:56:34,171 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-10-03 08:56:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:34,172 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-03 08:56:34,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-03 08:56:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-03 08:56:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-03 08:56:34,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:34,173 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-10-03 08:56:34,173 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:34,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:34,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-10-03 08:56:34,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:34,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:34,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:34,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:34,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:35,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:35,796 INFO L227 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 [2018-10-03 08:56:35,803 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:56:36,017 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-03 08:56:36,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:36,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:36,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:36,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:36,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:36,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:37,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:37,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-10-03 08:56:37,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-03 08:56:37,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-03 08:56:37,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-03 08:56:37,914 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-10-03 08:56:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:38,246 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-03 08:56:38,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-03 08:56:38,246 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-10-03 08:56:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:38,248 INFO L225 Difference]: With dead ends: 227 [2018-10-03 08:56:38,248 INFO L226 Difference]: Without dead ends: 226 [2018-10-03 08:56:38,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-03 08:56:38,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-03 08:56:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-10-03 08:56:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-03 08:56:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-03 08:56:38,254 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-10-03 08:56:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:38,254 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-03 08:56:38,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-03 08:56:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-03 08:56:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-03 08:56:38,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:38,256 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-10-03 08:56:38,256 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:38,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:38,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-10-03 08:56:38,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:38,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:38,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:38,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:38,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:40,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:40,107 INFO L227 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 [2018-10-03 08:56:40,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:56:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:40,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:40,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:40,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:40,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:40,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:42,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:42,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-10-03 08:56:42,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-03 08:56:42,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-03 08:56:42,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-03 08:56:42,164 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-10-03 08:56:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:42,575 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-03 08:56:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-03 08:56:42,575 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-10-03 08:56:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:42,577 INFO L225 Difference]: With dead ends: 231 [2018-10-03 08:56:42,577 INFO L226 Difference]: Without dead ends: 230 [2018-10-03 08:56:42,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-03 08:56:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-03 08:56:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-10-03 08:56:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-03 08:56:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-03 08:56:42,584 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-10-03 08:56:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:42,584 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-03 08:56:42,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-03 08:56:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-03 08:56:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-03 08:56:42,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:42,586 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-10-03 08:56:42,586 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:42,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-10-03 08:56:42,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:42,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:42,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:56:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:44,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:44,496 INFO L227 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 [2018-10-03 08:56:44,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:56:44,580 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:56:44,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:44,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:44,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:44,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:44,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:44,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:46,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:46,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-10-03 08:56:46,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-03 08:56:46,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-03 08:56:46,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-03 08:56:46,626 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-10-03 08:56:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:47,052 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-03 08:56:47,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-03 08:56:47,052 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-10-03 08:56:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:47,054 INFO L225 Difference]: With dead ends: 235 [2018-10-03 08:56:47,054 INFO L226 Difference]: Without dead ends: 234 [2018-10-03 08:56:47,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-03 08:56:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-03 08:56:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-10-03 08:56:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-03 08:56:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-03 08:56:47,059 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-10-03 08:56:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:47,059 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-03 08:56:47,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-03 08:56:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-03 08:56:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-03 08:56:47,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:47,061 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-10-03 08:56:47,061 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:47,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-10-03 08:56:47,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:47,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:47,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:47,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:47,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:49,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:49,497 INFO L227 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 [2018-10-03 08:56:49,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:56:49,800 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-03 08:56:49,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:49,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:49,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:49,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:49,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:49,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:52,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:52,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-10-03 08:56:52,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-03 08:56:52,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-03 08:56:52,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-03 08:56:52,019 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-10-03 08:56:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:52,451 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-03 08:56:52,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-03 08:56:52,451 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-10-03 08:56:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:52,453 INFO L225 Difference]: With dead ends: 239 [2018-10-03 08:56:52,453 INFO L226 Difference]: Without dead ends: 238 [2018-10-03 08:56:52,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-03 08:56:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-03 08:56:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-10-03 08:56:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-03 08:56:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-03 08:56:52,458 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-10-03 08:56:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:52,459 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-03 08:56:52,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-03 08:56:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-03 08:56:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-03 08:56:52,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:52,460 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-10-03 08:56:52,460 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:52,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:52,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-10-03 08:56:52,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:52,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:52,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:52,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:52,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:54,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:54,582 INFO L227 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 [2018-10-03 08:56:54,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:56:54,668 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:56:54,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:54,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:54,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:54,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:54,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:54,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:56,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:56,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-10-03 08:56:56,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-03 08:56:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-03 08:56:56,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-03 08:56:56,817 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-10-03 08:56:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:57,271 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-03 08:56:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-03 08:56:57,271 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-10-03 08:56:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:57,273 INFO L225 Difference]: With dead ends: 243 [2018-10-03 08:56:57,273 INFO L226 Difference]: Without dead ends: 242 [2018-10-03 08:56:57,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-03 08:56:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-03 08:56:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-10-03 08:56:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-03 08:56:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-03 08:56:57,278 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-10-03 08:56:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:57,279 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-03 08:56:57,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-03 08:56:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-03 08:56:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-03 08:56:57,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:57,280 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-10-03 08:56:57,280 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:56:57,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-10-03 08:56:57,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:57,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:59,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:59,416 INFO L227 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 [2018-10-03 08:56:59,522 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:56:59,694 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-03 08:56:59,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:59,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:59,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:59,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:59,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:59,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:01,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:01,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-10-03 08:57:01,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-03 08:57:01,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-03 08:57:01,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-03 08:57:01,900 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-10-03 08:57:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:02,285 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-03 08:57:02,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-03 08:57:02,285 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-10-03 08:57:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:02,287 INFO L225 Difference]: With dead ends: 247 [2018-10-03 08:57:02,287 INFO L226 Difference]: Without dead ends: 246 [2018-10-03 08:57:02,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-03 08:57:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-03 08:57:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-10-03 08:57:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-03 08:57:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-03 08:57:02,294 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-10-03 08:57:02,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:02,295 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-03 08:57:02,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-03 08:57:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-03 08:57:02,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-03 08:57:02,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:02,296 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-10-03 08:57:02,296 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:02,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:02,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-10-03 08:57:02,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:02,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:02,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:02,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:02,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:04,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:04,245 INFO L227 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 [2018-10-03 08:57:04,254 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:57:04,531 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-03 08:57:04,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:04,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:04,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:04,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:04,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:04,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:06,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:06,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-10-03 08:57:06,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-03 08:57:06,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-03 08:57:06,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-03 08:57:06,834 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-10-03 08:57:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:07,331 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-03 08:57:07,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-03 08:57:07,331 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-10-03 08:57:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:07,333 INFO L225 Difference]: With dead ends: 251 [2018-10-03 08:57:07,333 INFO L226 Difference]: Without dead ends: 250 [2018-10-03 08:57:07,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-03 08:57:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-03 08:57:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-10-03 08:57:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-03 08:57:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-03 08:57:07,339 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-10-03 08:57:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:07,339 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-03 08:57:07,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-03 08:57:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-03 08:57:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-03 08:57:07,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:07,341 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-10-03 08:57:07,341 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:07,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:07,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-10-03 08:57:07,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:07,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:07,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:07,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:07,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:09,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:09,422 INFO L227 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 [2018-10-03 08:57:09,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:57:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:09,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:09,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:09,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:09,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:09,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:11,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:11,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-10-03 08:57:11,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-03 08:57:11,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-03 08:57:11,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-03 08:57:11,851 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-10-03 08:57:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:12,305 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-03 08:57:12,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-03 08:57:12,306 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-10-03 08:57:12,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:12,307 INFO L225 Difference]: With dead ends: 255 [2018-10-03 08:57:12,307 INFO L226 Difference]: Without dead ends: 254 [2018-10-03 08:57:12,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-03 08:57:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-03 08:57:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-10-03 08:57:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-03 08:57:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-03 08:57:12,313 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-10-03 08:57:12,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:12,313 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-03 08:57:12,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-03 08:57:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-03 08:57:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-03 08:57:12,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:12,314 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-10-03 08:57:12,315 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:12,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-10-03 08:57:12,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:12,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:12,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:12,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:57:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:14,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:14,278 INFO L227 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 [2018-10-03 08:57:14,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:57:14,355 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:57:14,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:14,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:14,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:14,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:14,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:14,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:16,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:16,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-10-03 08:57:16,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-03 08:57:16,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-03 08:57:16,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-03 08:57:16,947 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-10-03 08:57:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:17,394 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-03 08:57:17,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-03 08:57:17,395 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-10-03 08:57:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:17,396 INFO L225 Difference]: With dead ends: 259 [2018-10-03 08:57:17,397 INFO L226 Difference]: Without dead ends: 258 [2018-10-03 08:57:17,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-03 08:57:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-03 08:57:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-10-03 08:57:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-03 08:57:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-03 08:57:17,402 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-10-03 08:57:17,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:17,402 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-03 08:57:17,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-03 08:57:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-03 08:57:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-03 08:57:17,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:17,404 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-10-03 08:57:17,404 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:17,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:17,404 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-10-03 08:57:17,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:17,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:17,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:17,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:17,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:19,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:19,447 INFO L227 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 [2018-10-03 08:57:19,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:57:19,773 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-03 08:57:19,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:19,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:19,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:19,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:19,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:19,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:22,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:22,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-10-03 08:57:22,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-03 08:57:22,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-03 08:57:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-03 08:57:22,285 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-10-03 08:57:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:22,747 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-03 08:57:22,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-03 08:57:22,747 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-10-03 08:57:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:22,749 INFO L225 Difference]: With dead ends: 263 [2018-10-03 08:57:22,749 INFO L226 Difference]: Without dead ends: 262 [2018-10-03 08:57:22,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-03 08:57:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-03 08:57:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-10-03 08:57:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-03 08:57:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-03 08:57:22,756 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-10-03 08:57:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:22,756 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-03 08:57:22,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-03 08:57:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-03 08:57:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-03 08:57:22,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:22,758 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-10-03 08:57:22,758 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:22,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:22,759 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-10-03 08:57:22,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:22,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:22,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:22,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:25,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:25,174 INFO L227 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 [2018-10-03 08:57:25,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:57:25,263 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:57:25,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:25,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:25,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:25,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:25,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:25,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:28,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:28,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-10-03 08:57:28,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-03 08:57:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-03 08:57:28,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-03 08:57:28,136 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-10-03 08:57:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:28,637 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-03 08:57:28,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-03 08:57:28,637 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-10-03 08:57:28,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:28,639 INFO L225 Difference]: With dead ends: 267 [2018-10-03 08:57:28,639 INFO L226 Difference]: Without dead ends: 266 [2018-10-03 08:57:28,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-03 08:57:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-03 08:57:28,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-10-03 08:57:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-03 08:57:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-03 08:57:28,646 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-10-03 08:57:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:28,647 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-03 08:57:28,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-03 08:57:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-03 08:57:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-03 08:57:28,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:28,648 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-10-03 08:57:28,649 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:28,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:28,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-10-03 08:57:28,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:28,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:28,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:28,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:28,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:31,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:31,095 INFO L227 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 [2018-10-03 08:57:31,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:57:31,309 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-03 08:57:31,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:31,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:31,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:31,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:31,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:31,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:33,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:33,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-10-03 08:57:33,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-03 08:57:33,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-03 08:57:33,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-03 08:57:33,985 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-10-03 08:57:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:34,499 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-03 08:57:34,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-03 08:57:34,499 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-10-03 08:57:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:34,501 INFO L225 Difference]: With dead ends: 271 [2018-10-03 08:57:34,501 INFO L226 Difference]: Without dead ends: 270 [2018-10-03 08:57:34,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-03 08:57:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-03 08:57:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-10-03 08:57:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-03 08:57:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-03 08:57:34,508 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-10-03 08:57:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:34,509 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-03 08:57:34,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-03 08:57:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-03 08:57:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-03 08:57:34,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:34,510 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-10-03 08:57:34,511 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:34,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:34,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-10-03 08:57:34,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:34,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:34,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:34,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:34,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:37,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:37,024 INFO L227 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 [2018-10-03 08:57:37,030 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:57:37,351 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-03 08:57:37,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:37,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:37,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:37,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:37,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:37,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:40,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:40,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-10-03 08:57:40,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-03 08:57:40,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-03 08:57:40,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-03 08:57:40,414 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-10-03 08:57:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:40,987 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-03 08:57:40,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-03 08:57:40,987 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-10-03 08:57:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:40,989 INFO L225 Difference]: With dead ends: 275 [2018-10-03 08:57:40,989 INFO L226 Difference]: Without dead ends: 274 [2018-10-03 08:57:40,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-03 08:57:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-03 08:57:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-10-03 08:57:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-03 08:57:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-03 08:57:40,995 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-10-03 08:57:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:40,995 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-03 08:57:40,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-03 08:57:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-03 08:57:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-03 08:57:40,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:40,996 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-10-03 08:57:40,996 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:40,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:40,997 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-10-03 08:57:40,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:40,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:40,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:40,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:40,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:43,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:43,266 INFO L227 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 [2018-10-03 08:57:43,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:57:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:43,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:43,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:43,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:43,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:43,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:46,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:46,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-10-03 08:57:46,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-03 08:57:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-03 08:57:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-03 08:57:46,313 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-10-03 08:57:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:46,763 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-03 08:57:46,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-03 08:57:46,763 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-10-03 08:57:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:46,765 INFO L225 Difference]: With dead ends: 279 [2018-10-03 08:57:46,765 INFO L226 Difference]: Without dead ends: 278 [2018-10-03 08:57:46,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-03 08:57:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-03 08:57:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-10-03 08:57:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-03 08:57:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-03 08:57:46,773 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-10-03 08:57:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:46,773 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-03 08:57:46,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-03 08:57:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-03 08:57:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-03 08:57:46,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:46,775 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-10-03 08:57:46,775 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:46,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:46,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-10-03 08:57:46,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:46,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:46,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:46,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:57:46,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:49,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:49,126 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:49,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:57:49,212 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:57:49,212 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:49,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:49,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:49,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:49,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:49,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:52,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:52,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-10-03 08:57:52,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-03 08:57:52,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-03 08:57:52,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-03 08:57:52,508 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-10-03 08:57:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:53,061 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-03 08:57:53,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-03 08:57:53,061 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-10-03 08:57:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:53,063 INFO L225 Difference]: With dead ends: 283 [2018-10-03 08:57:53,063 INFO L226 Difference]: Without dead ends: 282 [2018-10-03 08:57:53,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-03 08:57:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-03 08:57:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-10-03 08:57:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-03 08:57:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-03 08:57:53,070 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-10-03 08:57:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:53,070 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-03 08:57:53,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-03 08:57:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-03 08:57:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-03 08:57:53,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:53,072 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-10-03 08:57:53,072 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:53,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-10-03 08:57:53,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:53,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:53,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:53,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:53,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:55,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:55,874 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:55,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:57:56,290 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-03 08:57:56,291 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:56,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:56,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:56,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:56,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:56,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:59,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:59,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-10-03 08:57:59,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-03 08:57:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-03 08:57:59,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-03 08:57:59,218 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-10-03 08:57:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:59,685 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-03 08:57:59,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-03 08:57:59,686 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-10-03 08:57:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:59,687 INFO L225 Difference]: With dead ends: 287 [2018-10-03 08:57:59,687 INFO L226 Difference]: Without dead ends: 286 [2018-10-03 08:57:59,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-03 08:57:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-03 08:57:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-10-03 08:57:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-03 08:57:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-03 08:57:59,694 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-10-03 08:57:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:59,695 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-03 08:57:59,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-03 08:57:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-03 08:57:59,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-03 08:57:59,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:59,696 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-10-03 08:57:59,696 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:57:59,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-10-03 08:57:59,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:59,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:59,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:59,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:02,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:02,401 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:02,409 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:58:02,497 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:58:02,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:02,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:02,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:02,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:02,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:02,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:05,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:05,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-10-03 08:58:05,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-03 08:58:05,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-03 08:58:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-03 08:58:05,387 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-10-03 08:58:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:06,063 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-03 08:58:06,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-03 08:58:06,063 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-10-03 08:58:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:06,065 INFO L225 Difference]: With dead ends: 291 [2018-10-03 08:58:06,066 INFO L226 Difference]: Without dead ends: 290 [2018-10-03 08:58:06,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-03 08:58:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-03 08:58:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-10-03 08:58:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-03 08:58:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-03 08:58:06,074 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-10-03 08:58:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:06,074 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-03 08:58:06,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-03 08:58:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-03 08:58:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-03 08:58:06,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:06,076 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-10-03 08:58:06,076 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:58:06,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:06,076 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-10-03 08:58:06,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:06,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:06,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:06,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:06,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:08,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:08,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:08,606 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:58:08,846 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-03 08:58:08,846 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:08,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:08,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:08,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:08,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:08,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:12,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:12,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-10-03 08:58:12,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-03 08:58:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-03 08:58:12,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-03 08:58:12,163 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-10-03 08:58:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:12,678 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-03 08:58:12,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-03 08:58:12,678 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-10-03 08:58:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:12,680 INFO L225 Difference]: With dead ends: 295 [2018-10-03 08:58:12,680 INFO L226 Difference]: Without dead ends: 294 [2018-10-03 08:58:12,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-03 08:58:12,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-03 08:58:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-10-03 08:58:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-03 08:58:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-03 08:58:12,685 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-10-03 08:58:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:12,686 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-03 08:58:12,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-03 08:58:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-03 08:58:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-03 08:58:12,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:12,687 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-10-03 08:58:12,687 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:58:12,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-10-03 08:58:12,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:12,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:12,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:15,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:15,313 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:15,320 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:58:15,688 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-03 08:58:15,688 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:15,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:15,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:15,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:15,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:15,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:19,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:19,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-10-03 08:58:19,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-03 08:58:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-03 08:58:19,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-03 08:58:19,088 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-10-03 08:58:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:19,566 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-03 08:58:19,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-03 08:58:19,567 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-10-03 08:58:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:19,568 INFO L225 Difference]: With dead ends: 299 [2018-10-03 08:58:19,568 INFO L226 Difference]: Without dead ends: 298 [2018-10-03 08:58:19,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-03 08:58:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-03 08:58:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-10-03 08:58:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-03 08:58:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-03 08:58:19,574 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-10-03 08:58:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:19,574 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-03 08:58:19,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-03 08:58:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-03 08:58:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-03 08:58:19,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:19,575 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-10-03 08:58:19,575 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:58:19,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-10-03 08:58:19,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:19,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:19,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:19,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:19,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:22,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:22,290 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:22,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:58:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:22,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:22,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:22,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:22,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:22,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:25,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:25,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-10-03 08:58:25,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-10-03 08:58:25,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-10-03 08:58:25,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-03 08:58:25,603 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-10-03 08:58:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:26,109 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-03 08:58:26,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-03 08:58:26,110 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-10-03 08:58:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:26,111 INFO L225 Difference]: With dead ends: 303 [2018-10-03 08:58:26,112 INFO L226 Difference]: Without dead ends: 302 [2018-10-03 08:58:26,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-03 08:58:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-03 08:58:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-10-03 08:58:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-03 08:58:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-03 08:58:26,117 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-10-03 08:58:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:26,117 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-03 08:58:26,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-10-03 08:58:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-03 08:58:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-03 08:58:26,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:26,119 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-10-03 08:58:26,119 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:58:26,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-10-03 08:58:26,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:26,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:26,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:58:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:28,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:28,805 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:28,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:58:28,892 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:58:28,892 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:28,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:28,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:28,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:28,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:28,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:32,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:32,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-10-03 08:58:32,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-10-03 08:58:32,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-10-03 08:58:32,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-03 08:58:32,258 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-10-03 08:58:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:32,756 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-03 08:58:32,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-03 08:58:32,757 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-10-03 08:58:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:32,759 INFO L225 Difference]: With dead ends: 307 [2018-10-03 08:58:32,759 INFO L226 Difference]: Without dead ends: 306 [2018-10-03 08:58:32,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-03 08:58:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-03 08:58:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-10-03 08:58:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-03 08:58:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-03 08:58:32,764 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-10-03 08:58:32,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:32,764 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-03 08:58:32,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-10-03 08:58:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-03 08:58:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-03 08:58:32,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:32,766 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-10-03 08:58:32,766 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:58:32,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:32,766 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-10-03 08:58:32,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:32,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:32,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:32,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:32,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:35,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:35,518 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:35,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:58:35,962 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-03 08:58:35,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:35,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:35,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:35,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:35,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:35,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:39,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:39,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-10-03 08:58:39,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-10-03 08:58:39,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-10-03 08:58:39,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-03 08:58:39,333 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-10-03 08:58:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:39,870 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-03 08:58:39,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-03 08:58:39,870 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-10-03 08:58:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:39,872 INFO L225 Difference]: With dead ends: 311 [2018-10-03 08:58:39,872 INFO L226 Difference]: Without dead ends: 310 [2018-10-03 08:58:39,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-03 08:58:39,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-03 08:58:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-10-03 08:58:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-03 08:58:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-10-03 08:58:39,878 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-10-03 08:58:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:39,878 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-10-03 08:58:39,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-10-03 08:58:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-10-03 08:58:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-03 08:58:39,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:39,879 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-10-03 08:58:39,880 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:58:39,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-10-03 08:58:39,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:39,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:39,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:39,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:39,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:42,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:42,667 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:42,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:58:42,782 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:58:42,812 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:42,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:42,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:42,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:42,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:42,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-10-03 08:58:44,372 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-03 08:58:44,572 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:44,573 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-03 08:58:44,579 WARN L205 ceAbstractionStarter]: Timeout [2018-10-03 08:58:44,579 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 08:58:44 BoogieIcfgContainer [2018-10-03 08:58:44,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:58:44,580 INFO L168 Benchmark]: Toolchain (without parser) took 240878.76 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 383.8 MB. Max. memory is 7.1 GB. [2018-10-03 08:58:44,582 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:58:44,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:58:44,582 INFO L168 Benchmark]: Boogie Preprocessor took 25.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:58:44,583 INFO L168 Benchmark]: RCFGBuilder took 310.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-03 08:58:44,583 INFO L168 Benchmark]: TraceAbstraction took 240470.12 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 362.7 MB. Max. memory is 7.1 GB. [2018-10-03 08:58:44,585 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 310.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240470.12 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 362.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17). Cancelled while BasicCegarLoop was analyzing trace of length 309 with TraceHistMax 77, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 130 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 240.3s OverallTime, 77 OverallIterations, 77 TraceHistogramMax, 24.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 4233 SDslu, 4299 SDs, 0 SdLazy, 15998 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 182.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 76 MinimizatonAttempts, 76 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 8.8s SatisfiabilityAnalysisTime, 195.2s InterpolantComputationTime, 23404 NumberOfCodeBlocks, 23404 NumberOfCodeBlocksAsserted, 1607 NumberOfCheckSat, 23253 ConstructedInterpolants, 0 QuantifiedInterpolants, 37828463 SizeOfPredicates, 450 NumberOfNonLiveVariables, 21675 ConjunctsInSsa, 9300 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 0/579500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-58-44-594.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_08-58-44-594.csv Completed graceful shutdown