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-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:01:33,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:01:33,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:01:33,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:01:33,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:01:33,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:01:33,505 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:01:33,508 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:01:33,510 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:01:33,511 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:01:33,512 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:01:33,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:01:33,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:01:33,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:01:33,517 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:01:33,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:01:33,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:01:33,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:01:33,532 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:01:33,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:01:33,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:01:33,540 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:01:33,542 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:01:33,542 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:01:33,543 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:01:33,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:01:33,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:01:33,545 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:01:33,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:01:33,547 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:01:33,547 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:01:33,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:01:33,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:01:33,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:01:33,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:01:33,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:01:33,550 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-01 00:01:33,572 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:01:33,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:01:33,573 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:01:33,574 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:01:33,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:01:33,574 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:01:33,575 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:01:33,575 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:01:33,575 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:01:33,575 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:01:33,575 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:01:33,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:01:33,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:01:33,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:01:33,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:01:33,576 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:01:33,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:01:33,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:01:33,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:01:33,577 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:01:33,577 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:01:33,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:01:33,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:01:33,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:01:33,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:01:33,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:01:33,578 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:01:33,579 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:01:33,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:01:33,579 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:01:33,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:01:33,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:01:33,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:01:33,660 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:01:33,660 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:01:33,661 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2018-10-01 00:01:33,661 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2018-10-01 00:01:33,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:01:33,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:01:33,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:01:33,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:01:33,729 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:01:33,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (1/1) ... [2018-10-01 00:01:33,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (1/1) ... [2018-10-01 00:01:33,774 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:01:33,775 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:01:33,775 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:01:33,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:01:33,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:01:33,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:01:33,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:01:33,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (1/1) ... [2018-10-01 00:01:33,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (1/1) ... [2018-10-01 00:01:33,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (1/1) ... [2018-10-01 00:01:33,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (1/1) ... [2018-10-01 00:01:33,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (1/1) ... [2018-10-01 00:01:33,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (1/1) ... [2018-10-01 00:01:33,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (1/1) ... [2018-10-01 00:01:33,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:01:33,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:01:33,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:01:33,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:01:33,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (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-01 00:01:33,875 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-01 00:01:33,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-01 00:01:33,876 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-10-01 00:01:34,154 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:01:34,155 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:01:34 BoogieIcfgContainer [2018-10-01 00:01:34,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:01:34,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:01:34,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:01:34,159 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:01:34,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:01:33" (1/2) ... [2018-10-01 00:01:34,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d38cec and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:01:34, skipping insertion in model container [2018-10-01 00:01:34,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:01:34" (2/2) ... [2018-10-01 00:01:34,163 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2018-10-01 00:01:34,173 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:01:34,181 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:01:34,229 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:01:34,230 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:01:34,230 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:01:34,230 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:01:34,230 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:01:34,230 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:01:34,230 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:01:34,230 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:01:34,231 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:01:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-10-01 00:01:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:01:34,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:34,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:01:34,253 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:34,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:34,260 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-10-01 00:01:34,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:34,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:34,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:34,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:34,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:34,479 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-01 00:01:34,481 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:01:34,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-01 00:01:34,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:01:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:01:34,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-01 00:01:34,503 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-10-01 00:01:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:34,642 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-10-01 00:01:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:01:34,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-01 00:01:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:34,677 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:01:34,677 INFO L226 Difference]: Without dead ends: 10 [2018-10-01 00:01:34,681 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-01 00:01:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-01 00:01:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-10-01 00:01:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:01:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 00:01:34,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-10-01 00:01:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:34,717 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-01 00:01:34,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:01:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 00:01:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:01:34,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:34,718 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-01 00:01:34,718 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:34,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:34,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-10-01 00:01:34,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:34,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:34,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:34,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:34,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:34,800 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-01 00:01:34,800 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:34,801 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-01 00:01:34,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:34,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:34,904 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-01 00:01:34,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:35,015 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-01 00:01:35,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:35,170 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-01 00:01:35,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:35,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-10-01 00:01:35,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:01:35,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:01:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-01 00:01:35,204 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-10-01 00:01:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:35,307 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-01 00:01:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:01:35,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-01 00:01:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:35,308 INFO L225 Difference]: With dead ends: 15 [2018-10-01 00:01:35,309 INFO L226 Difference]: Without dead ends: 14 [2018-10-01 00:01:35,310 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-01 00:01:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-01 00:01:35,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-10-01 00:01:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-01 00:01:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-01 00:01:35,314 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-10-01 00:01:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:35,314 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-01 00:01:35,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:01:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-01 00:01:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:01:35,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:35,316 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-10-01 00:01:35,316 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:35,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:35,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-10-01 00:01:35,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:35,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:35,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:35,552 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-01 00:01:35,553 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:35,553 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-01 00:01:35,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:35,618 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:35,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:35,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:35,647 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-01 00:01:35,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:35,743 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-01 00:01:35,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:35,895 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-01 00:01:35,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:35,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-10-01 00:01:35,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:01:35,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:01:35,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-01 00:01:35,919 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-10-01 00:01:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:35,990 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-01 00:01:35,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:01:35,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:01:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:35,992 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:01:35,992 INFO L226 Difference]: Without dead ends: 18 [2018-10-01 00:01:35,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-01 00:01:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-01 00:01:35,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-01 00:01:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-01 00:01:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-01 00:01:35,998 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-10-01 00:01:35,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:35,998 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-01 00:01:35,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:01:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-01 00:01:35,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:01:35,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:36,000 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-10-01 00:01:36,000 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:36,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:36,001 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-10-01 00:01:36,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:36,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:36,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:36,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:36,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:36,129 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-01 00:01:36,130 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:36,130 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-01 00:01:36,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:36,202 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:01:36,203 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:36,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:36,232 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-01 00:01:36,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:36,267 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-01 00:01:36,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:36,439 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-01 00:01:36,464 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:36,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-01 00:01:36,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:01:36,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:01:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-01 00:01:36,466 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-10-01 00:01:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:36,535 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-01 00:01:36,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:01:36,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-10-01 00:01:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:36,536 INFO L225 Difference]: With dead ends: 23 [2018-10-01 00:01:36,537 INFO L226 Difference]: Without dead ends: 22 [2018-10-01 00:01:36,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-01 00:01:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-01 00:01:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-01 00:01:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:01:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-01 00:01:36,543 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-10-01 00:01:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:36,543 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-01 00:01:36,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:01:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-01 00:01:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:01:36,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:36,545 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-10-01 00:01:36,545 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:36,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:36,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-10-01 00:01:36,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:36,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:36,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:36,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:36,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:36,662 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-01 00:01:36,662 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:36,662 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-01 00:01:36,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:36,699 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:36,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:36,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:36,723 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-01 00:01:36,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:36,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-01 00:01:36,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:37,222 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-01 00:01:37,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:37,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-10-01 00:01:37,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:01:37,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:01:37,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-01 00:01:37,248 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-10-01 00:01:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:37,330 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-01 00:01:37,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:01:37,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-10-01 00:01:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:37,332 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:01:37,332 INFO L226 Difference]: Without dead ends: 26 [2018-10-01 00:01:37,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-01 00:01:37,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-01 00:01:37,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-01 00:01:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:01:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-01 00:01:37,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-10-01 00:01:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:37,338 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-01 00:01:37,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:01:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-01 00:01:37,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:01:37,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:37,339 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-10-01 00:01:37,339 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:37,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:37,340 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-10-01 00:01:37,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:37,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:37,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:37,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:37,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:37,492 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-01 00:01:37,493 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:37,493 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-01 00:01:37,502 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:37,519 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:01:37,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:37,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:37,532 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-01 00:01:37,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:37,542 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-01 00:01:37,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:37,684 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-01 00:01:37,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:37,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-01 00:01:37,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:01:37,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:01:37,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-01 00:01:37,707 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-10-01 00:01:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:37,764 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-01 00:01:37,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:01:37,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-10-01 00:01:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:37,770 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:01:37,770 INFO L226 Difference]: Without dead ends: 30 [2018-10-01 00:01:37,771 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-01 00:01:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-01 00:01:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-01 00:01:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:01:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-01 00:01:37,776 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-10-01 00:01:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:37,776 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-01 00:01:37,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:01:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-01 00:01:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:01:37,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:37,778 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-10-01 00:01:37,778 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:37,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:37,778 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-10-01 00:01:37,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:37,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:37,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:37,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:37,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:38,027 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-01 00:01:38,027 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:38,027 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-01 00:01:38,038 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:38,063 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:01:38,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:38,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:38,073 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-01 00:01:38,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:38,084 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-01 00:01:38,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:38,261 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-01 00:01:38,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:38,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-01 00:01:38,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:01:38,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:01:38,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-01 00:01:38,284 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-10-01 00:01:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:38,374 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-01 00:01:38,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:01:38,376 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-10-01 00:01:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:38,378 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:01:38,378 INFO L226 Difference]: Without dead ends: 34 [2018-10-01 00:01:38,379 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-01 00:01:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-01 00:01:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-01 00:01:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:01:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-01 00:01:38,386 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-10-01 00:01:38,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:38,387 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-01 00:01:38,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:01:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-01 00:01:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:01:38,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:38,388 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-10-01 00:01:38,388 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:38,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:38,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-10-01 00:01:38,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:38,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:38,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:38,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:38,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:38,551 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-01 00:01:38,551 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:38,551 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-01 00:01:38,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:38,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:38,608 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-01 00:01:38,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:38,618 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-01 00:01:38,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:38,789 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-01 00:01:38,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:38,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-01 00:01:38,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:01:38,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:01:38,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-01 00:01:38,821 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-10-01 00:01:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:39,052 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-01 00:01:39,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:01:39,056 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-10-01 00:01:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:39,057 INFO L225 Difference]: With dead ends: 39 [2018-10-01 00:01:39,057 INFO L226 Difference]: Without dead ends: 38 [2018-10-01 00:01:39,058 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-01 00:01:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-01 00:01:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-01 00:01:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:01:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-01 00:01:39,069 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-10-01 00:01:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:39,070 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-01 00:01:39,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:01:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-01 00:01:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:01:39,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:39,074 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-10-01 00:01:39,075 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:39,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:39,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-10-01 00:01:39,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:39,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:39,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:39,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:39,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:39,325 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-01 00:01:39,325 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:39,325 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-01 00:01:39,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:39,349 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:39,349 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:39,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:39,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-01 00:01:39,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:39,412 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-01 00:01:39,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:39,604 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-01 00:01:39,623 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:39,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-10-01 00:01:39,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:01:39,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:01:39,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-01 00:01:39,626 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-10-01 00:01:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:39,754 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-01 00:01:39,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:01:39,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-10-01 00:01:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:39,759 INFO L225 Difference]: With dead ends: 43 [2018-10-01 00:01:39,759 INFO L226 Difference]: Without dead ends: 42 [2018-10-01 00:01:39,759 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-01 00:01:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-01 00:01:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-01 00:01:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:01:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-01 00:01:39,766 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-10-01 00:01:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:39,766 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-01 00:01:39,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:01:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-01 00:01:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 00:01:39,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:39,768 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-10-01 00:01:39,768 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:39,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:39,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-10-01 00:01:39,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:39,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:39,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:39,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:39,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:39,979 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-01 00:01:39,979 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:39,979 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-01 00:01:39,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:40,016 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-01 00:01:40,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:40,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:40,029 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-01 00:01:40,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:40,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-01 00:01:40,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:40,511 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-01 00:01:40,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:40,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-10-01 00:01:40,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:01:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:01:40,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-01 00:01:40,534 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-10-01 00:01:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:40,674 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-01 00:01:40,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:01:40,675 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-10-01 00:01:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:40,676 INFO L225 Difference]: With dead ends: 47 [2018-10-01 00:01:40,676 INFO L226 Difference]: Without dead ends: 46 [2018-10-01 00:01:40,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-01 00:01:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-01 00:01:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-01 00:01:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-01 00:01:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-01 00:01:40,684 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-10-01 00:01:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:40,684 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-01 00:01:40,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:01:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-01 00:01:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 00:01:40,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:40,686 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-10-01 00:01:40,686 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:40,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:40,686 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-10-01 00:01:40,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:40,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:40,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:41,417 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-01 00:01:41,417 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:41,417 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-01 00:01:41,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:41,474 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:41,475 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:41,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:41,504 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-01 00:01:41,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:41,596 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-01 00:01:41,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:42,070 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-01 00:01:42,091 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:42,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-10-01 00:01:42,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:01:42,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:01:42,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-01 00:01:42,092 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-10-01 00:01:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:42,212 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-01 00:01:42,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:01:42,212 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-10-01 00:01:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:42,214 INFO L225 Difference]: With dead ends: 51 [2018-10-01 00:01:42,214 INFO L226 Difference]: Without dead ends: 50 [2018-10-01 00:01:42,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-01 00:01:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-01 00:01:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-01 00:01:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-01 00:01:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-01 00:01:42,220 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-10-01 00:01:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:42,220 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-01 00:01:42,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:01:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-01 00:01:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 00:01:42,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:42,221 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-10-01 00:01:42,221 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:42,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-10-01 00:01:42,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:42,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:42,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:42,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:42,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:42,493 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-01 00:01:42,494 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:42,494 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-01 00:01:42,504 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:42,572 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-01 00:01:42,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:42,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:42,602 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-01 00:01:42,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:42,641 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-01 00:01:42,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:42,938 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-01 00:01:42,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:42,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-10-01 00:01:42,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:01:42,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:01:42,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-01 00:01:42,960 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-10-01 00:01:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:43,057 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-01 00:01:43,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:01:43,057 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-10-01 00:01:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:43,058 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:01:43,059 INFO L226 Difference]: Without dead ends: 54 [2018-10-01 00:01:43,060 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-01 00:01:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-01 00:01:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-01 00:01:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 00:01:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-01 00:01:43,066 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-10-01 00:01:43,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:43,066 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-01 00:01:43,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:01:43,066 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-01 00:01:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:01:43,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:43,067 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-10-01 00:01:43,068 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:43,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-10-01 00:01:43,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:43,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:43,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:43,332 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-01 00:01:43,332 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:43,333 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-01 00:01:43,339 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:43,372 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:01:43,372 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:43,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:43,380 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-01 00:01:43,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:43,391 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-01 00:01:43,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:43,615 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-01 00:01:43,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:43,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-10-01 00:01:43,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:01:43,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:01:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-01 00:01:43,637 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-10-01 00:01:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:43,751 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-01 00:01:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:01:43,752 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-10-01 00:01:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:43,753 INFO L225 Difference]: With dead ends: 59 [2018-10-01 00:01:43,753 INFO L226 Difference]: Without dead ends: 58 [2018-10-01 00:01:43,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-01 00:01:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-01 00:01:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-01 00:01:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-01 00:01:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-01 00:01:43,761 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-10-01 00:01:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:43,762 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-01 00:01:43,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:01:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-01 00:01:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-01 00:01:43,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:43,763 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-10-01 00:01:43,763 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:43,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-10-01 00:01:43,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:43,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:43,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:44,110 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-01 00:01:44,110 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:44,110 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-01 00:01:44,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:44,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:44,147 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-01 00:01:44,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:44,156 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-01 00:01:44,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:44,449 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-01 00:01:44,479 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:44,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-10-01 00:01:44,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:01:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:01:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-01 00:01:44,480 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-10-01 00:01:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:44,686 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-01 00:01:44,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:01:44,686 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-10-01 00:01:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:44,687 INFO L225 Difference]: With dead ends: 63 [2018-10-01 00:01:44,688 INFO L226 Difference]: Without dead ends: 62 [2018-10-01 00:01:44,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-01 00:01:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-01 00:01:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-01 00:01:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-01 00:01:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-01 00:01:44,695 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-10-01 00:01:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:44,695 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-01 00:01:44,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:01:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-01 00:01:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-01 00:01:44,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:44,697 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-10-01 00:01:44,697 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:44,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:44,697 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-10-01 00:01:44,698 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:44,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:44,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:44,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:44,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:44,967 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-01 00:01:44,967 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:44,968 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-01 00:01:44,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:44,998 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:44,999 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:45,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:45,019 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-01 00:01:45,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:45,030 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-01 00:01:45,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:45,503 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-01 00:01:45,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:45,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-10-01 00:01:45,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:01:45,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:01:45,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-01 00:01:45,524 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-10-01 00:01:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:45,734 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-01 00:01:45,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:01:45,734 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-10-01 00:01:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:45,735 INFO L225 Difference]: With dead ends: 67 [2018-10-01 00:01:45,735 INFO L226 Difference]: Without dead ends: 66 [2018-10-01 00:01:45,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-01 00:01:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-01 00:01:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-01 00:01:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-01 00:01:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-01 00:01:45,746 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-10-01 00:01:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:45,747 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-01 00:01:45,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:01:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-01 00:01:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-01 00:01:45,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:45,748 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-10-01 00:01:45,748 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:45,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:45,749 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-10-01 00:01:45,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:45,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:45,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:45,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:45,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:46,221 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-01 00:01:46,221 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:46,221 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-01 00:01:46,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:46,264 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-01 00:01:46,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:46,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:46,278 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-01 00:01:46,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:46,289 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-01 00:01:46,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:46,569 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-01 00:01:46,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:46,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-10-01 00:01:46,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:01:46,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:01:46,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-01 00:01:46,591 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-10-01 00:01:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:46,836 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-01 00:01:46,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:01:46,836 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-10-01 00:01:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:46,837 INFO L225 Difference]: With dead ends: 71 [2018-10-01 00:01:46,837 INFO L226 Difference]: Without dead ends: 70 [2018-10-01 00:01:46,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-01 00:01:46,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-01 00:01:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-01 00:01:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-01 00:01:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-01 00:01:46,846 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-10-01 00:01:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:46,846 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-01 00:01:46,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:01:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-01 00:01:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 00:01:46,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:46,847 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-10-01 00:01:46,848 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:46,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:46,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-10-01 00:01:46,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:46,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:46,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:46,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:46,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:47,152 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-01 00:01:47,152 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:47,152 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-01 00:01:47,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:47,184 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:47,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:47,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:47,206 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-01 00:01:47,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:47,218 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-01 00:01:47,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:47,596 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-01 00:01:47,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:47,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-10-01 00:01:47,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:01:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:01:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-01 00:01:47,617 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-10-01 00:01:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:47,731 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-01 00:01:47,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:01:47,731 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-10-01 00:01:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:47,732 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:01:47,732 INFO L226 Difference]: Without dead ends: 74 [2018-10-01 00:01:47,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-01 00:01:47,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-01 00:01:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-01 00:01:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 00:01:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-01 00:01:47,739 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-10-01 00:01:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:47,739 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-01 00:01:47,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:01:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-01 00:01:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-01 00:01:47,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:47,740 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-10-01 00:01:47,740 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:47,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-10-01 00:01:47,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:47,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:47,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:48,069 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-01 00:01:48,069 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:48,070 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-01 00:01:48,077 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:48,110 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-01 00:01:48,110 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:48,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:48,116 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-01 00:01:48,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:48,124 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-01 00:01:48,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:48,467 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-01 00:01:48,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:48,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-10-01 00:01:48,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:01:48,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:01:48,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-01 00:01:48,489 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-10-01 00:01:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:48,591 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-01 00:01:48,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:01:48,592 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-10-01 00:01:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:48,593 INFO L225 Difference]: With dead ends: 79 [2018-10-01 00:01:48,593 INFO L226 Difference]: Without dead ends: 78 [2018-10-01 00:01:48,594 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-01 00:01:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-01 00:01:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-01 00:01:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-01 00:01:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-01 00:01:48,598 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-10-01 00:01:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:48,598 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-01 00:01:48,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:01:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-01 00:01:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-01 00:01:48,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:48,600 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-10-01 00:01:48,600 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:48,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:48,600 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-10-01 00:01:48,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:48,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:48,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:48,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:49,054 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-01 00:01:49,054 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:49,054 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-01 00:01:49,063 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:49,104 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 00:01:49,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:49,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:49,121 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-01 00:01:49,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:49,129 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-01 00:01:49,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:49,599 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-01 00:01:49,619 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:49,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-10-01 00:01:49,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-01 00:01:49,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-01 00:01:49,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-01 00:01:49,621 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-10-01 00:01:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:49,737 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-01 00:01:49,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:01:49,738 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-10-01 00:01:49,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:49,739 INFO L225 Difference]: With dead ends: 83 [2018-10-01 00:01:49,739 INFO L226 Difference]: Without dead ends: 82 [2018-10-01 00:01:49,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-01 00:01:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-01 00:01:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-01 00:01:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-01 00:01:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-01 00:01:49,744 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-10-01 00:01:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:49,744 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-01 00:01:49,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-01 00:01:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-01 00:01:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-01 00:01:49,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:49,745 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-10-01 00:01:49,745 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:49,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:49,745 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-10-01 00:01:49,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:49,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:49,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:49,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:50,126 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-01 00:01:50,126 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:50,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 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-01 00:01:50,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:50,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:50,180 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-01 00:01:50,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:50,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-01 00:01:50,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:50,979 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-01 00:01:51,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:51,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-10-01 00:01:51,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-01 00:01:51,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-01 00:01:51,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-01 00:01:51,001 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-10-01 00:01:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:51,171 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-01 00:01:51,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:01:51,172 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-10-01 00:01:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:51,173 INFO L225 Difference]: With dead ends: 87 [2018-10-01 00:01:51,173 INFO L226 Difference]: Without dead ends: 86 [2018-10-01 00:01:51,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-01 00:01:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-01 00:01:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-01 00:01:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-01 00:01:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-01 00:01:51,179 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-10-01 00:01:51,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:51,180 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-01 00:01:51,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-01 00:01:51,180 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-01 00:01:51,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-01 00:01:51,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:51,181 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-10-01 00:01:51,181 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:51,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:51,182 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-10-01 00:01:51,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:51,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:51,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:51,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:51,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:52,044 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-01 00:01:52,044 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:52,044 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-01 00:01:52,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:52,086 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:52,086 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:52,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:52,092 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-01 00:01:52,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:52,102 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-01 00:01:52,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:52,444 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-01 00:01:52,464 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:52,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-10-01 00:01:52,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-01 00:01:52,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-01 00:01:52,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-01 00:01:52,466 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-10-01 00:01:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:52,627 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-01 00:01:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:01:52,630 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-10-01 00:01:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:52,631 INFO L225 Difference]: With dead ends: 91 [2018-10-01 00:01:52,631 INFO L226 Difference]: Without dead ends: 90 [2018-10-01 00:01:52,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-01 00:01:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-01 00:01:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-01 00:01:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-01 00:01:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-01 00:01:52,635 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-10-01 00:01:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:52,635 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-01 00:01:52,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-01 00:01:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-01 00:01:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-01 00:01:52,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:52,637 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-10-01 00:01:52,637 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:52,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:52,637 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-10-01 00:01:52,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:52,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:52,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:52,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:52,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:53,128 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-01 00:01:53,128 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:53,128 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-01 00:01:53,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:53,186 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-01 00:01:53,186 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:53,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:53,196 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-01 00:01:53,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:53,207 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-01 00:01:53,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:55,050 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-01 00:01:55,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:55,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-10-01 00:01:55,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 00:01:55,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 00:01:55,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-01 00:01:55,075 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-10-01 00:01:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:55,221 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-01 00:01:55,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:01:55,223 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-10-01 00:01:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:55,225 INFO L225 Difference]: With dead ends: 95 [2018-10-01 00:01:55,225 INFO L226 Difference]: Without dead ends: 94 [2018-10-01 00:01:55,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-01 00:01:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-01 00:01:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-01 00:01:55,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-01 00:01:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-01 00:01:55,229 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-10-01 00:01:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:55,229 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-01 00:01:55,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 00:01:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-01 00:01:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-01 00:01:55,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:55,230 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-10-01 00:01:55,231 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:55,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-10-01 00:01:55,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:55,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:55,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:55,945 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-01 00:01:55,945 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:55,945 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-01 00:01:55,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:55,990 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:55,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:55,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:56,001 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-01 00:01:56,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:56,013 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-01 00:01:56,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:56,425 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-01 00:01:56,445 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:56,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-10-01 00:01:56,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 00:01:56,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 00:01:56,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-01 00:01:56,447 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-10-01 00:01:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:56,598 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-01 00:01:56,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:01:56,599 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-10-01 00:01:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:56,600 INFO L225 Difference]: With dead ends: 99 [2018-10-01 00:01:56,600 INFO L226 Difference]: Without dead ends: 98 [2018-10-01 00:01:56,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-01 00:01:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-01 00:01:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-01 00:01:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-01 00:01:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-01 00:01:56,605 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-10-01 00:01:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:56,606 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-01 00:01:56,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 00:01:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-01 00:01:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-01 00:01:56,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:56,607 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-10-01 00:01:56,607 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:56,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-10-01 00:01:56,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:56,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:56,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:56,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:57,027 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-01 00:01:57,027 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:57,027 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-01 00:01:57,035 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:57,080 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-01 00:01:57,080 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:57,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:57,105 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-01 00:01:57,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:57,186 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-01 00:01:57,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:57,752 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-01 00:01:57,773 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:57,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-10-01 00:01:57,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-01 00:01:57,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-01 00:01:57,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-01 00:01:57,775 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-10-01 00:01:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:58,035 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-01 00:01:58,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:01:58,035 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-10-01 00:01:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:58,037 INFO L225 Difference]: With dead ends: 103 [2018-10-01 00:01:58,037 INFO L226 Difference]: Without dead ends: 102 [2018-10-01 00:01:58,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-01 00:01:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-01 00:01:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-10-01 00:01:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-01 00:01:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-01 00:01:58,045 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-10-01 00:01:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:58,045 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-01 00:01:58,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-01 00:01:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-01 00:01:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-01 00:01:58,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:58,047 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-10-01 00:01:58,047 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:58,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:58,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-10-01 00:01:58,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:58,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:58,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:58,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:58,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:58,559 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-01 00:01:58,559 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:58,559 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-01 00:01:58,567 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:58,627 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 00:01:58,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:58,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:58,634 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-01 00:01:58,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:58,651 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-01 00:01:58,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:59,128 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-01 00:01:59,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:59,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-10-01 00:01:59,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:01:59,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:01:59,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-01 00:01:59,151 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-10-01 00:01:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:59,351 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-01 00:01:59,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:01:59,352 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-10-01 00:01:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:59,353 INFO L225 Difference]: With dead ends: 107 [2018-10-01 00:01:59,353 INFO L226 Difference]: Without dead ends: 106 [2018-10-01 00:01:59,355 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-01 00:01:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-01 00:01:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-01 00:01:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-01 00:01:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-01 00:01:59,359 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-10-01 00:01:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:59,359 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-01 00:01:59,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:01:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-01 00:01:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-01 00:01:59,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:59,360 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-10-01 00:01:59,360 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:01:59,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:59,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-10-01 00:01:59,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:59,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:59,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:59,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:59,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:59,893 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-01 00:01:59,893 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:59,893 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-01 00:01:59,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:59,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:59,933 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-01 00:01:59,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:59,942 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-01 00:01:59,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:00,836 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-01 00:02:00,856 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:00,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-10-01 00:02:00,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-01 00:02:00,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-01 00:02:00,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-01 00:02:00,858 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-10-01 00:02:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:01,047 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-01 00:02:01,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:02:01,047 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-10-01 00:02:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:01,048 INFO L225 Difference]: With dead ends: 111 [2018-10-01 00:02:01,049 INFO L226 Difference]: Without dead ends: 110 [2018-10-01 00:02:01,050 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-01 00:02:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-01 00:02:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-01 00:02:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-01 00:02:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-01 00:02:01,055 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-10-01 00:02:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:01,055 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-01 00:02:01,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-01 00:02:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-01 00:02:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-01 00:02:01,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:01,056 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-10-01 00:02:01,056 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:01,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-10-01 00:02:01,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:01,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:01,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:01,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:01,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:01,566 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-01 00:02:01,566 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:01,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 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-01 00:02:01,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:02:01,611 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:02:01,612 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:01,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:01,619 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-01 00:02:01,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:01,632 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-01 00:02:01,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:02,166 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-01 00:02:02,186 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:02,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-10-01 00:02:02,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-01 00:02:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-01 00:02:02,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-01 00:02:02,188 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-10-01 00:02:02,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:02,384 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-01 00:02:02,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:02:02,384 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-10-01 00:02:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:02,385 INFO L225 Difference]: With dead ends: 115 [2018-10-01 00:02:02,386 INFO L226 Difference]: Without dead ends: 114 [2018-10-01 00:02:02,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-01 00:02:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-01 00:02:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-01 00:02:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-01 00:02:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-01 00:02:02,390 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-10-01 00:02:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:02,391 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-01 00:02:02,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-01 00:02:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-01 00:02:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-01 00:02:02,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:02,392 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-10-01 00:02:02,392 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:02,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-10-01 00:02:02,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:02,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:02,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:03,022 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-01 00:02:03,022 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:03,022 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-01 00:02:03,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:02:03,105 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-01 00:02:03,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:03,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:03,142 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-01 00:02:03,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:03,155 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-01 00:02:03,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:03,710 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-01 00:02:03,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:03,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-10-01 00:02:03,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-01 00:02:03,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-01 00:02:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-01 00:02:03,734 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-10-01 00:02:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:03,942 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-01 00:02:03,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:02:03,943 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-10-01 00:02:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:03,944 INFO L225 Difference]: With dead ends: 119 [2018-10-01 00:02:03,944 INFO L226 Difference]: Without dead ends: 118 [2018-10-01 00:02:03,945 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-01 00:02:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-01 00:02:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-01 00:02:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-01 00:02:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-01 00:02:03,949 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-10-01 00:02:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:03,949 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-01 00:02:03,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-01 00:02:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-01 00:02:03,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-01 00:02:03,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:03,950 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-10-01 00:02:03,950 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:03,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:03,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-10-01 00:02:03,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:03,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:03,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:03,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:04,648 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-01 00:02:04,649 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:04,649 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-01 00:02:04,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:02:04,688 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:02:04,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:04,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:04,713 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-01 00:02:04,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:04,796 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-01 00:02:04,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:05,423 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-01 00:02:05,444 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:05,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-10-01 00:02:05,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-01 00:02:05,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-01 00:02:05,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-01 00:02:05,445 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-10-01 00:02:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:05,625 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-01 00:02:05,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:02:05,625 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-10-01 00:02:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:05,627 INFO L225 Difference]: With dead ends: 123 [2018-10-01 00:02:05,627 INFO L226 Difference]: Without dead ends: 122 [2018-10-01 00:02:05,628 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-01 00:02:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-01 00:02:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-01 00:02:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-01 00:02:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-01 00:02:05,633 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-10-01 00:02:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:05,633 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-01 00:02:05,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-01 00:02:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-01 00:02:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-01 00:02:05,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:05,634 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-10-01 00:02:05,635 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:05,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-10-01 00:02:05,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:05,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:05,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:06,386 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-01 00:02:06,386 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:06,386 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-01 00:02:06,394 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:02:06,465 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-01 00:02:06,465 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:06,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:06,471 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-01 00:02:06,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:06,480 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-01 00:02:06,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:07,112 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-01 00:02:07,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:07,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-10-01 00:02:07,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-01 00:02:07,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-01 00:02:07,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-01 00:02:07,134 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-10-01 00:02:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:07,383 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-01 00:02:07,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:02:07,384 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-10-01 00:02:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:07,387 INFO L225 Difference]: With dead ends: 127 [2018-10-01 00:02:07,387 INFO L226 Difference]: Without dead ends: 126 [2018-10-01 00:02:07,388 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-01 00:02:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-01 00:02:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-10-01 00:02:07,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-01 00:02:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-01 00:02:07,394 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-10-01 00:02:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:07,394 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-01 00:02:07,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-01 00:02:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-01 00:02:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-01 00:02:07,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:07,395 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-10-01 00:02:07,395 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:07,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:07,396 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-10-01 00:02:07,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:07,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:07,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:07,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:07,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:08,153 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-01 00:02:08,153 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:08,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 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-01 00:02:08,163 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:02:08,240 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-01 00:02:08,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:08,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:08,246 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-01 00:02:08,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:08,256 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-01 00:02:08,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:08,941 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-01 00:02:08,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:08,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-10-01 00:02:08,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-01 00:02:08,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-01 00:02:08,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-01 00:02:08,962 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-10-01 00:02:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:09,170 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-01 00:02:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:02:09,171 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-10-01 00:02:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:09,172 INFO L225 Difference]: With dead ends: 131 [2018-10-01 00:02:09,172 INFO L226 Difference]: Without dead ends: 130 [2018-10-01 00:02:09,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-01 00:02:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-01 00:02:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-01 00:02:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-01 00:02:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-01 00:02:09,178 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-10-01 00:02:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:09,178 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-01 00:02:09,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-01 00:02:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-01 00:02:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-01 00:02:09,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:09,179 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-10-01 00:02:09,179 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:09,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-10-01 00:02:09,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:09,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:09,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:09,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:09,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:09,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-01 00:02:09,850 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:09,851 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-01 00:02:09,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:09,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:09,901 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-01 00:02:09,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:09,909 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-01 00:02:09,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:10,607 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-01 00:02:10,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:10,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-10-01 00:02:10,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-01 00:02:10,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-01 00:02:10,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-01 00:02:10,629 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-10-01 00:02:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:10,850 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-01 00:02:10,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:02:10,850 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-10-01 00:02:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:10,851 INFO L225 Difference]: With dead ends: 135 [2018-10-01 00:02:10,851 INFO L226 Difference]: Without dead ends: 134 [2018-10-01 00:02:10,852 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-01 00:02:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-01 00:02:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-01 00:02:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-01 00:02:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-01 00:02:10,856 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-10-01 00:02:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:10,857 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-01 00:02:10,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-01 00:02:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-01 00:02:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-01 00:02:10,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:10,858 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-10-01 00:02:10,858 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:10,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-10-01 00:02:10,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:10,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:10,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:11,662 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-01 00:02:11,662 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:11,662 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-01 00:02:11,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:02:11,718 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:02:11,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:11,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:11,730 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-01 00:02:11,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:11,740 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-01 00:02:11,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:12,765 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-01 00:02:12,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:12,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-10-01 00:02:12,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-01 00:02:12,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-01 00:02:12,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-01 00:02:12,787 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-10-01 00:02:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:13,017 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-01 00:02:13,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:02:13,018 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-10-01 00:02:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:13,019 INFO L225 Difference]: With dead ends: 139 [2018-10-01 00:02:13,019 INFO L226 Difference]: Without dead ends: 138 [2018-10-01 00:02:13,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-01 00:02:13,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-01 00:02:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-01 00:02:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-01 00:02:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-01 00:02:13,026 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-10-01 00:02:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:13,026 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-01 00:02:13,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-01 00:02:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-01 00:02:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-01 00:02:13,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:13,027 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-10-01 00:02:13,027 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:13,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-10-01 00:02:13,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:13,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:13,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:13,727 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-01 00:02:13,727 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:13,727 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-01 00:02:13,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:02:13,902 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-01 00:02:13,902 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:13,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:13,925 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-01 00:02:13,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:14,017 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-01 00:02:14,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:16,426 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-01 00:02:16,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:16,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-10-01 00:02:16,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-01 00:02:16,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-01 00:02:16,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-01 00:02:16,448 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-10-01 00:02:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:16,758 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-01 00:02:16,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:02:16,759 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-10-01 00:02:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:16,760 INFO L225 Difference]: With dead ends: 143 [2018-10-01 00:02:16,760 INFO L226 Difference]: Without dead ends: 142 [2018-10-01 00:02:16,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-01 00:02:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-01 00:02:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-01 00:02:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-01 00:02:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-01 00:02:16,768 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-10-01 00:02:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:16,769 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-01 00:02:16,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-01 00:02:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-01 00:02:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-01 00:02:16,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:16,770 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-10-01 00:02:16,770 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:16,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-10-01 00:02:16,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:16,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:16,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:16,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:17,573 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-01 00:02:17,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:17,573 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-01 00:02:17,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:02:17,621 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:02:17,621 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:17,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:17,628 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-01 00:02:17,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:17,726 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-01 00:02:17,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:18,642 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-01 00:02:18,663 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:18,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-10-01 00:02:18,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-01 00:02:18,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-01 00:02:18,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-01 00:02:18,665 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-10-01 00:02:19,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:19,069 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-01 00:02:19,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:02:19,069 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-10-01 00:02:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:19,071 INFO L225 Difference]: With dead ends: 147 [2018-10-01 00:02:19,071 INFO L226 Difference]: Without dead ends: 146 [2018-10-01 00:02:19,072 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-01 00:02:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-01 00:02:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-01 00:02:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-01 00:02:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-01 00:02:19,078 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-10-01 00:02:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:19,078 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-01 00:02:19,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-01 00:02:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-01 00:02:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-01 00:02:19,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:19,079 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-10-01 00:02:19,080 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:19,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-10-01 00:02:19,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:19,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:19,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:19,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:19,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:19,950 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-01 00:02:19,950 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:19,950 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-01 00:02:19,958 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:02:20,091 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-01 00:02:20,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:20,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:20,098 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-01 00:02:20,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:20,108 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-01 00:02:20,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:21,009 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-01 00:02:21,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:21,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-10-01 00:02:21,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-01 00:02:21,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-01 00:02:21,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-01 00:02:21,030 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-10-01 00:02:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:21,450 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-01 00:02:21,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:02:21,451 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-10-01 00:02:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:21,453 INFO L225 Difference]: With dead ends: 151 [2018-10-01 00:02:21,453 INFO L226 Difference]: Without dead ends: 150 [2018-10-01 00:02:21,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-01 00:02:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-01 00:02:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-10-01 00:02:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-01 00:02:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-01 00:02:21,458 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-10-01 00:02:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:21,459 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-01 00:02:21,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-01 00:02:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-01 00:02:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-01 00:02:21,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:21,460 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-10-01 00:02:21,460 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:21,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-10-01 00:02:21,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:21,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:21,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:21,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:21,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:22,708 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-01 00:02:22,708 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:22,709 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-01 00:02:22,716 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:02:22,825 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-01 00:02:22,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:22,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:22,841 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-01 00:02:22,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:22,855 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-01 00:02:22,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:23,760 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-01 00:02:23,781 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:23,781 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-10-01 00:02:23,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-01 00:02:23,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-01 00:02:23,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-01 00:02:23,783 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-10-01 00:02:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:24,070 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-01 00:02:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:02:24,071 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-10-01 00:02:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:24,073 INFO L225 Difference]: With dead ends: 155 [2018-10-01 00:02:24,073 INFO L226 Difference]: Without dead ends: 154 [2018-10-01 00:02:24,074 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-01 00:02:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-01 00:02:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-01 00:02:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-01 00:02:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-01 00:02:24,079 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-10-01 00:02:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:24,079 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-01 00:02:24,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-01 00:02:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-01 00:02:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-01 00:02:24,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:24,081 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-10-01 00:02:24,081 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:24,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:24,081 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-10-01 00:02:24,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:24,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:24,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:24,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:24,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:24,972 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-01 00:02:24,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:24,972 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-01 00:02:24,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:25,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:25,053 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-01 00:02:25,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:25,110 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-01 00:02:25,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:26,473 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-01 00:02:26,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:26,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-10-01 00:02:26,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-01 00:02:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-01 00:02:26,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-01 00:02:26,495 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-10-01 00:02:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:26,762 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-01 00:02:26,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 00:02:26,762 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-10-01 00:02:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:26,764 INFO L225 Difference]: With dead ends: 159 [2018-10-01 00:02:26,764 INFO L226 Difference]: Without dead ends: 158 [2018-10-01 00:02:26,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-01 00:02:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-01 00:02:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-01 00:02:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-01 00:02:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-01 00:02:26,770 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-10-01 00:02:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:26,770 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-01 00:02:26,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-01 00:02:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-01 00:02:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-01 00:02:26,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:26,772 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-10-01 00:02:26,772 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:26,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:26,772 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-10-01 00:02:26,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:26,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:26,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:29,439 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-01 00:02:29,439 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:29,439 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-01 00:02:29,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:02:29,490 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:02:29,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:29,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:29,496 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-01 00:02:29,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:29,509 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-01 00:02:29,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:30,517 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-01 00:02:30,537 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:30,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-10-01 00:02:30,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-01 00:02:30,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-01 00:02:30,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-01 00:02:30,539 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-10-01 00:02:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:30,846 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-01 00:02:30,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:02:30,846 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-10-01 00:02:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:30,848 INFO L225 Difference]: With dead ends: 163 [2018-10-01 00:02:30,848 INFO L226 Difference]: Without dead ends: 162 [2018-10-01 00:02:30,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-01 00:02:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-01 00:02:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-01 00:02:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-01 00:02:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-01 00:02:30,854 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-10-01 00:02:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:30,854 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-01 00:02:30,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-01 00:02:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-01 00:02:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-01 00:02:30,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:30,856 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-10-01 00:02:30,856 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:30,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-10-01 00:02:30,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:30,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:30,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:33,043 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-01 00:02:33,043 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:33,043 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-01 00:02:33,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:02:33,433 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-01 00:02:33,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:33,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:33,443 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-01 00:02:33,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:33,451 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-01 00:02:33,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:34,488 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-01 00:02:34,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:34,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-10-01 00:02:34,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-01 00:02:34,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-01 00:02:34,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-01 00:02:34,510 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-10-01 00:02:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:34,787 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-01 00:02:34,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:02:34,788 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-10-01 00:02:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:34,789 INFO L225 Difference]: With dead ends: 167 [2018-10-01 00:02:34,789 INFO L226 Difference]: Without dead ends: 166 [2018-10-01 00:02:34,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-01 00:02:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-01 00:02:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-01 00:02:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-01 00:02:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-01 00:02:34,795 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-10-01 00:02:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:34,796 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-01 00:02:34,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-01 00:02:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-01 00:02:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-01 00:02:34,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:34,797 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-10-01 00:02:34,797 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:34,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-10-01 00:02:34,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:34,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:34,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:34,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:34,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:35,842 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-01 00:02:35,842 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:35,842 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-01 00:02:35,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:02:35,894 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:02:35,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:35,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:35,917 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-01 00:02:35,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:35,946 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-01 00:02:35,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:37,217 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-01 00:02:37,237 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:37,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-10-01 00:02:37,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-01 00:02:37,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-01 00:02:37,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-01 00:02:37,240 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-10-01 00:02:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:37,677 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-01 00:02:37,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:02:37,678 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-10-01 00:02:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:37,679 INFO L225 Difference]: With dead ends: 171 [2018-10-01 00:02:37,680 INFO L226 Difference]: Without dead ends: 170 [2018-10-01 00:02:37,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-01 00:02:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-01 00:02:37,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-01 00:02:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-01 00:02:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-01 00:02:37,684 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-10-01 00:02:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:37,684 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-01 00:02:37,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-01 00:02:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-01 00:02:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-01 00:02:37,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:37,685 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-10-01 00:02:37,685 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:37,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-10-01 00:02:37,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:37,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:37,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:38,711 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-01 00:02:38,712 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:38,712 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-01 00:02:38,726 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:02:38,881 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-01 00:02:38,882 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:38,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:38,908 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-01 00:02:38,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:38,999 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-01 00:02:39,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:40,131 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-01 00:02:40,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:40,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-10-01 00:02:40,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-01 00:02:40,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-01 00:02:40,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-01 00:02:40,153 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-10-01 00:02:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:40,473 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-01 00:02:40,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 00:02:40,474 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-10-01 00:02:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:40,475 INFO L225 Difference]: With dead ends: 175 [2018-10-01 00:02:40,475 INFO L226 Difference]: Without dead ends: 174 [2018-10-01 00:02:40,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-01 00:02:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-01 00:02:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-01 00:02:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-01 00:02:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-01 00:02:40,481 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-10-01 00:02:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:40,482 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-01 00:02:40,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-01 00:02:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-01 00:02:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-01 00:02:40,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:40,483 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-10-01 00:02:40,483 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:40,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:40,483 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-10-01 00:02:40,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:40,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:40,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:40,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:40,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:41,486 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-01 00:02:41,487 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:41,487 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-01 00:02:41,502 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:02:41,708 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-01 00:02:41,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:41,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:41,715 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-01 00:02:41,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:41,726 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-01 00:02:41,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:42,933 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-01 00:02:42,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:42,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-10-01 00:02:42,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-01 00:02:42,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-01 00:02:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-01 00:02:42,956 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-10-01 00:02:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:43,572 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-01 00:02:43,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 00:02:43,572 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-10-01 00:02:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:43,574 INFO L225 Difference]: With dead ends: 179 [2018-10-01 00:02:43,574 INFO L226 Difference]: Without dead ends: 178 [2018-10-01 00:02:43,575 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-01 00:02:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-01 00:02:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-01 00:02:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-01 00:02:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-01 00:02:43,580 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-10-01 00:02:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:43,581 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-01 00:02:43,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-01 00:02:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-01 00:02:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-01 00:02:43,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:43,582 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-10-01 00:02:43,582 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:43,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-10-01 00:02:43,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:43,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:43,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:44,711 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-01 00:02:44,711 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:44,711 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-01 00:02:44,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:44,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:44,770 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-01 00:02:44,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:44,781 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-01 00:02:44,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:46,023 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-01 00:02:46,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:46,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-10-01 00:02:46,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-01 00:02:46,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-01 00:02:46,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-01 00:02:46,045 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-10-01 00:02:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:46,326 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-01 00:02:46,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 00:02:46,326 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-10-01 00:02:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:46,327 INFO L225 Difference]: With dead ends: 183 [2018-10-01 00:02:46,328 INFO L226 Difference]: Without dead ends: 182 [2018-10-01 00:02:46,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-01 00:02:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-01 00:02:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-01 00:02:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-01 00:02:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-01 00:02:46,332 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-10-01 00:02:46,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:46,332 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-01 00:02:46,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-01 00:02:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-01 00:02:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-01 00:02:46,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:46,333 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-10-01 00:02:46,334 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:46,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:46,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-10-01 00:02:46,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:46,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:46,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:46,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:46,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:47,797 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-01 00:02:47,798 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:47,798 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-01 00:02:47,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:02:47,850 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:02:47,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:47,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:47,856 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-01 00:02:47,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:47,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-01 00:02:47,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:49,258 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-01 00:02:49,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:49,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-10-01 00:02:49,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-01 00:02:49,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-01 00:02:49,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-01 00:02:49,279 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-10-01 00:02:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:49,566 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-01 00:02:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:02:49,566 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-10-01 00:02:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:49,568 INFO L225 Difference]: With dead ends: 187 [2018-10-01 00:02:49,568 INFO L226 Difference]: Without dead ends: 186 [2018-10-01 00:02:49,568 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-01 00:02:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-01 00:02:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-01 00:02:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-01 00:02:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-01 00:02:49,573 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-10-01 00:02:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:49,573 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-01 00:02:49,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-01 00:02:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-01 00:02:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-01 00:02:49,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:49,574 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-10-01 00:02:49,575 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:49,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:49,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-10-01 00:02:49,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:49,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:49,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:49,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:49,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:50,776 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-01 00:02:50,776 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:50,776 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-01 00:02:50,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:02:50,947 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-01 00:02:50,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:50,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:50,954 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-01 00:02:50,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:50,963 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-01 00:02:50,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:52,533 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-01 00:02:52,553 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:52,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-10-01 00:02:52,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-01 00:02:52,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-01 00:02:52,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-01 00:02:52,555 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-10-01 00:02:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:52,888 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-01 00:02:52,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:02:52,888 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-10-01 00:02:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:52,889 INFO L225 Difference]: With dead ends: 191 [2018-10-01 00:02:52,890 INFO L226 Difference]: Without dead ends: 190 [2018-10-01 00:02:52,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-01 00:02:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-01 00:02:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-10-01 00:02:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-01 00:02:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-01 00:02:52,894 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-10-01 00:02:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:52,895 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-01 00:02:52,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-01 00:02:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-01 00:02:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-01 00:02:52,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:52,896 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-10-01 00:02:52,896 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:52,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:52,896 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-10-01 00:02:52,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:52,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:52,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:52,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:52,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:54,641 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-01 00:02:54,641 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:54,641 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-01 00:02:54,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:02:54,708 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:02:54,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:54,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:54,730 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-01 00:02:54,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:54,794 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-01 00:02:54,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:57,579 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-01 00:02:57,599 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:57,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-10-01 00:02:57,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-01 00:02:57,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-01 00:02:57,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-01 00:02:57,601 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-10-01 00:02:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:58,070 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-01 00:02:58,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:02:58,071 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-10-01 00:02:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:58,073 INFO L225 Difference]: With dead ends: 195 [2018-10-01 00:02:58,073 INFO L226 Difference]: Without dead ends: 194 [2018-10-01 00:02:58,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-01 00:02:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-01 00:02:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-10-01 00:02:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-01 00:02:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-01 00:02:58,079 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-10-01 00:02:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:58,079 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-01 00:02:58,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-01 00:02:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-01 00:02:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-01 00:02:58,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:58,081 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-10-01 00:02:58,081 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:02:58,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-10-01 00:02:58,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:58,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:58,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:59,455 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-01 00:02:59,456 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:59,456 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-01 00:02:59,463 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:02:59,584 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-01 00:02:59,584 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:59,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:59,607 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-01 00:02:59,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:59,662 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-01 00:02:59,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:01,158 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-01 00:03:01,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:01,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-10-01 00:03:01,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-01 00:03:01,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-01 00:03:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-01 00:03:01,180 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-10-01 00:03:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:01,531 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-01 00:03:01,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 00:03:01,531 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-10-01 00:03:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:01,533 INFO L225 Difference]: With dead ends: 199 [2018-10-01 00:03:01,533 INFO L226 Difference]: Without dead ends: 198 [2018-10-01 00:03:01,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-01 00:03:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-01 00:03:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-10-01 00:03:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-01 00:03:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-01 00:03:01,539 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-10-01 00:03:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:01,539 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-01 00:03:01,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-01 00:03:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-01 00:03:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-01 00:03:01,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:01,540 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-10-01 00:03:01,540 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:01,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:01,541 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-10-01 00:03:01,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:01,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:01,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:01,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:01,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:03,137 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-01 00:03:03,137 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:03,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 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-01 00:03:03,145 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:03:03,318 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-01 00:03:03,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:03,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:03,325 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-01 00:03:03,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:03,337 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-01 00:03:03,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:04,847 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-01 00:03:04,867 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:04,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-10-01 00:03:04,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-01 00:03:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-01 00:03:04,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-01 00:03:04,869 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-10-01 00:03:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:05,232 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-01 00:03:05,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 00:03:05,233 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-10-01 00:03:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:05,234 INFO L225 Difference]: With dead ends: 203 [2018-10-01 00:03:05,234 INFO L226 Difference]: Without dead ends: 202 [2018-10-01 00:03:05,236 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-01 00:03:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-01 00:03:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-10-01 00:03:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-01 00:03:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-01 00:03:05,240 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-10-01 00:03:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:05,240 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-01 00:03:05,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-01 00:03:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-01 00:03:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-01 00:03:05,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:05,241 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-10-01 00:03:05,241 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:05,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:05,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-10-01 00:03:05,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:05,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:05,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:05,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:05,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:06,549 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-01 00:03:06,549 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:06,549 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-01 00:03:06,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:06,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:06,615 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-01 00:03:06,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:06,631 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-01 00:03:06,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:08,389 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-01 00:03:08,409 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:08,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-10-01 00:03:08,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-01 00:03:08,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-01 00:03:08,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-01 00:03:08,411 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-10-01 00:03:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:08,739 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-01 00:03:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:03:08,740 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-10-01 00:03:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:08,742 INFO L225 Difference]: With dead ends: 207 [2018-10-01 00:03:08,742 INFO L226 Difference]: Without dead ends: 206 [2018-10-01 00:03:08,743 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-01 00:03:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-01 00:03:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-10-01 00:03:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-01 00:03:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-01 00:03:08,747 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-10-01 00:03:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:08,747 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-01 00:03:08,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-01 00:03:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-01 00:03:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-01 00:03:08,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:08,748 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-10-01 00:03:08,749 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:08,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-10-01 00:03:08,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:08,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:08,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:08,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:08,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:10,168 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-01 00:03:10,169 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:10,169 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-01 00:03:10,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:03:10,229 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:03:10,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:10,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:10,236 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-01 00:03:10,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:10,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-01 00:03:10,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:12,184 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-01 00:03:12,204 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:12,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-10-01 00:03:12,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-01 00:03:12,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-01 00:03:12,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-01 00:03:12,206 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-10-01 00:03:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:12,601 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-01 00:03:12,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:03:12,601 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-10-01 00:03:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:12,602 INFO L225 Difference]: With dead ends: 211 [2018-10-01 00:03:12,602 INFO L226 Difference]: Without dead ends: 210 [2018-10-01 00:03:12,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-01 00:03:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-01 00:03:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-10-01 00:03:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-01 00:03:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-01 00:03:12,609 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-10-01 00:03:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:12,609 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-01 00:03:12,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-01 00:03:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-01 00:03:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-01 00:03:12,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:12,611 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-10-01 00:03:12,611 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:12,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:12,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-10-01 00:03:12,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:12,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:12,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:12,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:12,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:14,012 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-01 00:03:14,013 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:14,013 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-01 00:03:14,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:03:14,384 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-01 00:03:14,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:14,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:14,404 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-01 00:03:14,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:14,424 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-01 00:03:14,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:16,120 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-01 00:03:16,140 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:16,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-10-01 00:03:16,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-01 00:03:16,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-01 00:03:16,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-01 00:03:16,143 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-10-01 00:03:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:16,486 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-01 00:03:16,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 00:03:16,486 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-10-01 00:03:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:16,488 INFO L225 Difference]: With dead ends: 215 [2018-10-01 00:03:16,489 INFO L226 Difference]: Without dead ends: 214 [2018-10-01 00:03:16,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-01 00:03:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-01 00:03:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-10-01 00:03:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-01 00:03:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-01 00:03:16,495 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-10-01 00:03:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:16,495 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-01 00:03:16,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-01 00:03:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-01 00:03:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-01 00:03:16,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:16,497 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-10-01 00:03:16,497 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:16,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:16,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-10-01 00:03:16,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:16,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:16,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:16,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:18,283 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-01 00:03:18,283 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:18,283 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-01 00:03:18,291 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:03:18,436 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:03:18,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:18,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:18,461 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-01 00:03:18,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:18,492 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-01 00:03:18,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:20,254 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-01 00:03:20,275 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:20,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-10-01 00:03:20,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-01 00:03:20,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-01 00:03:20,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-01 00:03:20,277 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-10-01 00:03:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:20,620 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-01 00:03:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:03:20,620 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-10-01 00:03:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:20,622 INFO L225 Difference]: With dead ends: 219 [2018-10-01 00:03:20,622 INFO L226 Difference]: Without dead ends: 218 [2018-10-01 00:03:20,623 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-01 00:03:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-01 00:03:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-10-01 00:03:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-01 00:03:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-01 00:03:20,627 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-10-01 00:03:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:20,628 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-01 00:03:20,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-01 00:03:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-01 00:03:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-01 00:03:20,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:20,629 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-10-01 00:03:20,629 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:20,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:20,629 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-10-01 00:03:20,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:20,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:20,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:22,073 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-01 00:03:22,074 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:22,074 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-01 00:03:22,081 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:03:22,223 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-01 00:03:22,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:22,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:22,232 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-01 00:03:22,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:22,240 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-01 00:03:22,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:24,289 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-01 00:03:24,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:24,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-10-01 00:03:24,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-01 00:03:24,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-01 00:03:24,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-01 00:03:24,311 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-10-01 00:03:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:24,669 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-01 00:03:24,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 00:03:24,670 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-10-01 00:03:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:24,671 INFO L225 Difference]: With dead ends: 223 [2018-10-01 00:03:24,671 INFO L226 Difference]: Without dead ends: 222 [2018-10-01 00:03:24,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-01 00:03:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-01 00:03:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-10-01 00:03:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-01 00:03:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-01 00:03:24,677 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-10-01 00:03:24,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:24,677 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-01 00:03:24,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-01 00:03:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-01 00:03:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-01 00:03:24,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:24,678 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-10-01 00:03:24,678 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:24,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-10-01 00:03:24,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:24,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:24,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:26,350 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-01 00:03:26,350 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:26,350 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-01 00:03:26,357 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:03:26,547 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-01 00:03:26,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:26,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:26,554 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-01 00:03:26,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:26,562 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-01 00:03:26,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:28,664 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-01 00:03:28,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:28,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-10-01 00:03:28,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-01 00:03:28,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-01 00:03:28,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-01 00:03:28,686 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-10-01 00:03:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:29,016 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-01 00:03:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-01 00:03:29,016 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-10-01 00:03:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:29,018 INFO L225 Difference]: With dead ends: 227 [2018-10-01 00:03:29,018 INFO L226 Difference]: Without dead ends: 226 [2018-10-01 00:03:29,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-01 00:03:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-01 00:03:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-10-01 00:03:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-01 00:03:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-01 00:03:29,025 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-10-01 00:03:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:29,025 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-01 00:03:29,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-01 00:03:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-01 00:03:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-01 00:03:29,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:29,026 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-10-01 00:03:29,027 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:29,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:29,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-10-01 00:03:29,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:29,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:29,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:29,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:29,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:30,614 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-01 00:03:30,614 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:30,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 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-01 00:03:30,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:30,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:30,686 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-01 00:03:30,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:30,696 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-01 00:03:30,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:32,582 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-01 00:03:32,602 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:32,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-10-01 00:03:32,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-01 00:03:32,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-01 00:03:32,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-01 00:03:32,604 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-10-01 00:03:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:33,044 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-01 00:03:33,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-01 00:03:33,044 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-10-01 00:03:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:33,046 INFO L225 Difference]: With dead ends: 231 [2018-10-01 00:03:33,046 INFO L226 Difference]: Without dead ends: 230 [2018-10-01 00:03:33,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-01 00:03:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-01 00:03:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-10-01 00:03:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-01 00:03:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-01 00:03:33,053 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-10-01 00:03:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:33,053 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-01 00:03:33,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-01 00:03:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-01 00:03:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-01 00:03:33,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:33,054 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-10-01 00:03:33,055 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:33,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:33,055 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-10-01 00:03:33,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:33,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:33,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:33,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:33,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:34,723 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-01 00:03:34,723 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:34,723 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-01 00:03:34,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:03:34,798 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:03:34,798 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:34,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:34,805 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-01 00:03:34,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:34,816 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-01 00:03:34,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:36,901 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-01 00:03:36,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:36,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-10-01 00:03:36,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-01 00:03:36,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-01 00:03:36,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-01 00:03:36,925 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-10-01 00:03:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:37,348 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-01 00:03:37,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-01 00:03:37,348 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-10-01 00:03:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:37,350 INFO L225 Difference]: With dead ends: 235 [2018-10-01 00:03:37,350 INFO L226 Difference]: Without dead ends: 234 [2018-10-01 00:03:37,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-01 00:03:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-01 00:03:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-10-01 00:03:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-01 00:03:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-01 00:03:37,356 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-10-01 00:03:37,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:37,356 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-01 00:03:37,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-01 00:03:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-01 00:03:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-01 00:03:37,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:37,357 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-10-01 00:03:37,358 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:37,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:37,358 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-10-01 00:03:37,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:37,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:37,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:37,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:37,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:39,574 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-01 00:03:39,574 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:39,575 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-01 00:03:39,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:03:39,832 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-01 00:03:39,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:39,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:39,845 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-01 00:03:39,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:39,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-01 00:03:39,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:42,146 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-01 00:03:42,166 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:42,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-10-01 00:03:42,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-01 00:03:42,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-01 00:03:42,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-01 00:03:42,168 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-10-01 00:03:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:42,582 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-01 00:03:42,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-01 00:03:42,583 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-10-01 00:03:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:42,584 INFO L225 Difference]: With dead ends: 239 [2018-10-01 00:03:42,585 INFO L226 Difference]: Without dead ends: 238 [2018-10-01 00:03:42,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-01 00:03:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-01 00:03:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-10-01 00:03:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-01 00:03:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-01 00:03:42,590 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-10-01 00:03:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:42,590 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-01 00:03:42,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-01 00:03:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-01 00:03:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-01 00:03:42,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:42,591 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-10-01 00:03:42,591 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:42,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:42,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-10-01 00:03:42,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:42,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:42,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:42,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:42,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:44,699 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-01 00:03:44,700 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:44,700 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-01 00:03:44,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:03:44,776 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:03:44,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:44,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:44,785 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-01 00:03:44,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:44,797 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-01 00:03:44,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:46,905 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-01 00:03:46,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:46,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-10-01 00:03:46,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-01 00:03:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-01 00:03:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-01 00:03:46,928 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-10-01 00:03:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:47,355 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-01 00:03:47,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-01 00:03:47,356 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-10-01 00:03:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:47,358 INFO L225 Difference]: With dead ends: 243 [2018-10-01 00:03:47,358 INFO L226 Difference]: Without dead ends: 242 [2018-10-01 00:03:47,359 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-01 00:03:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-01 00:03:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-10-01 00:03:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-01 00:03:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-01 00:03:47,363 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-10-01 00:03:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:47,363 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-01 00:03:47,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-01 00:03:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-01 00:03:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-01 00:03:47,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:47,364 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-10-01 00:03:47,364 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:47,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-10-01 00:03:47,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:47,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:49,462 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-01 00:03:49,462 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:49,462 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-01 00:03:49,470 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:03:49,639 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-01 00:03:49,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:49,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:49,651 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-01 00:03:49,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:49,659 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-01 00:03:49,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:51,918 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-01 00:03:51,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:51,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-10-01 00:03:51,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-01 00:03:51,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-01 00:03:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-01 00:03:51,942 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-10-01 00:03:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:52,329 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-01 00:03:52,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-01 00:03:52,330 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-10-01 00:03:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:52,331 INFO L225 Difference]: With dead ends: 247 [2018-10-01 00:03:52,331 INFO L226 Difference]: Without dead ends: 246 [2018-10-01 00:03:52,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-01 00:03:52,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-01 00:03:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-10-01 00:03:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-01 00:03:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-01 00:03:52,338 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-10-01 00:03:52,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:52,338 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-01 00:03:52,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-01 00:03:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-01 00:03:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-01 00:03:52,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:52,340 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-10-01 00:03:52,340 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:52,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:52,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-10-01 00:03:52,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:52,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:52,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:52,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:52,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:54,398 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-01 00:03:54,399 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:54,399 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-01 00:03:54,408 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:03:54,623 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-01 00:03:54,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:54,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:54,633 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-01 00:03:54,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:54,641 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-01 00:03:54,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:56,950 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-01 00:03:56,970 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:56,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-10-01 00:03:56,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-01 00:03:56,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-01 00:03:56,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-01 00:03:56,972 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-10-01 00:03:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:57,450 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-01 00:03:57,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-01 00:03:57,450 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-10-01 00:03:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:57,451 INFO L225 Difference]: With dead ends: 251 [2018-10-01 00:03:57,451 INFO L226 Difference]: Without dead ends: 250 [2018-10-01 00:03:57,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-01 00:03:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-01 00:03:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-10-01 00:03:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-01 00:03:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-01 00:03:57,459 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-10-01 00:03:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:57,459 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-01 00:03:57,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-01 00:03:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-01 00:03:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-01 00:03:57,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:57,460 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-10-01 00:03:57,461 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:03:57,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-10-01 00:03:57,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:57,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:57,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:57,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:57,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:59,580 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-01 00:03:59,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:59,581 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-01 00:03:59,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:59,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:59,658 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-01 00:03:59,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:59,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-01 00:03:59,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:02,034 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-01 00:04:02,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:02,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-10-01 00:04:02,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-01 00:04:02,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-01 00:04:02,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-01 00:04:02,057 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-10-01 00:04:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:02,501 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-01 00:04:02,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-01 00:04:02,502 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-10-01 00:04:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:02,503 INFO L225 Difference]: With dead ends: 255 [2018-10-01 00:04:02,504 INFO L226 Difference]: Without dead ends: 254 [2018-10-01 00:04:02,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-01 00:04:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-01 00:04:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-10-01 00:04:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-01 00:04:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-01 00:04:02,509 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-10-01 00:04:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:02,509 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-01 00:04:02,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-01 00:04:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-01 00:04:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-01 00:04:02,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:02,510 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-10-01 00:04:02,511 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:04:02,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:02,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-10-01 00:04:02,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:02,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:02,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:02,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:04:02,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:04,837 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-01 00:04:04,837 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:04,837 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-01 00:04:04,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:04:04,907 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:04:04,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:04,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:04,916 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-01 00:04:04,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:04,930 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-01 00:04:04,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:07,325 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-01 00:04:07,345 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:07,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-10-01 00:04:07,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-01 00:04:07,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-01 00:04:07,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-01 00:04:07,348 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-10-01 00:04:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:07,858 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-01 00:04:07,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-01 00:04:07,859 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-10-01 00:04:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:07,860 INFO L225 Difference]: With dead ends: 259 [2018-10-01 00:04:07,860 INFO L226 Difference]: Without dead ends: 258 [2018-10-01 00:04:07,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-01 00:04:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-01 00:04:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-10-01 00:04:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-01 00:04:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-01 00:04:07,865 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-10-01 00:04:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:07,865 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-01 00:04:07,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-01 00:04:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-01 00:04:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-01 00:04:07,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:07,867 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-10-01 00:04:07,867 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:04:07,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-10-01 00:04:07,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:07,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:07,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:07,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:10,213 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-01 00:04:10,213 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:10,214 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-01 00:04:10,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:04:10,526 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-01 00:04:10,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:10,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:10,535 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-01 00:04:10,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:10,548 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-01 00:04:10,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:12,988 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-01 00:04:13,009 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:13,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-10-01 00:04:13,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-01 00:04:13,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-01 00:04:13,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-01 00:04:13,012 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-10-01 00:04:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:13,484 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-01 00:04:13,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-01 00:04:13,485 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-10-01 00:04:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:13,487 INFO L225 Difference]: With dead ends: 263 [2018-10-01 00:04:13,487 INFO L226 Difference]: Without dead ends: 262 [2018-10-01 00:04:13,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-01 00:04:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-01 00:04:13,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-10-01 00:04:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-01 00:04:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-01 00:04:13,494 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-10-01 00:04:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:13,494 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-01 00:04:13,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-01 00:04:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-01 00:04:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-01 00:04:13,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:13,496 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-10-01 00:04:13,496 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:04:13,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:13,496 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-10-01 00:04:13,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:13,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:13,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:15,845 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-01 00:04:15,845 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:15,846 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-01 00:04:15,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:04:15,930 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:04:15,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:15,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:15,944 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-01 00:04:15,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:15,954 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-01 00:04:15,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:18,746 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-01 00:04:18,767 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:18,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-10-01 00:04:18,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-01 00:04:18,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-01 00:04:18,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-01 00:04:18,770 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-10-01 00:04:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:19,340 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-01 00:04:19,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 00:04:19,340 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-10-01 00:04:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:19,342 INFO L225 Difference]: With dead ends: 267 [2018-10-01 00:04:19,342 INFO L226 Difference]: Without dead ends: 266 [2018-10-01 00:04:19,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-01 00:04:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-01 00:04:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-10-01 00:04:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-01 00:04:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-01 00:04:19,348 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-10-01 00:04:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:19,349 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-01 00:04:19,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-01 00:04:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-01 00:04:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-01 00:04:19,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:19,350 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-10-01 00:04:19,350 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:04:19,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:19,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-10-01 00:04:19,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:19,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:19,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:19,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:19,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:21,707 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-01 00:04:21,707 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:21,707 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-01 00:04:21,714 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:04:21,910 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-01 00:04:21,910 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:21,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:21,920 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-01 00:04:21,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:21,931 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-01 00:04:21,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:24,802 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-01 00:04:24,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:24,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-10-01 00:04:24,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-01 00:04:24,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-01 00:04:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-01 00:04:24,825 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-10-01 00:04:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:25,328 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-01 00:04:25,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-01 00:04:25,328 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-10-01 00:04:25,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:25,330 INFO L225 Difference]: With dead ends: 271 [2018-10-01 00:04:25,330 INFO L226 Difference]: Without dead ends: 270 [2018-10-01 00:04:25,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-01 00:04:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-01 00:04:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-10-01 00:04:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-01 00:04:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-01 00:04:25,337 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-10-01 00:04:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:25,337 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-01 00:04:25,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-01 00:04:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-01 00:04:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-01 00:04:25,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:25,339 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-10-01 00:04:25,340 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:04:25,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:25,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-10-01 00:04:25,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:25,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:25,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:25,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:25,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:27,642 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-01 00:04:27,642 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:27,642 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-01 00:04:27,650 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:04:27,906 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-01 00:04:27,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:27,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:27,916 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-01 00:04:27,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:27,926 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-01 00:04:27,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:30,877 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-01 00:04:30,897 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:30,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-10-01 00:04:30,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-01 00:04:30,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-01 00:04:30,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-01 00:04:30,900 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-10-01 00:04:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:31,459 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-01 00:04:31,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-01 00:04:31,460 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-10-01 00:04:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:31,461 INFO L225 Difference]: With dead ends: 275 [2018-10-01 00:04:31,462 INFO L226 Difference]: Without dead ends: 274 [2018-10-01 00:04:31,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-01 00:04:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-01 00:04:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-10-01 00:04:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-01 00:04:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-01 00:04:31,467 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-10-01 00:04:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:31,467 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-01 00:04:31,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-01 00:04:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-01 00:04:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-01 00:04:31,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:31,469 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-10-01 00:04:31,469 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:04:31,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-10-01 00:04:31,469 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:31,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:31,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:33,895 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-01 00:04:33,895 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:33,895 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-01 00:04:33,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:04:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:33,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:33,982 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-01 00:04:33,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:33,990 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-01 00:04:33,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:36,982 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-01 00:04:37,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:37,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-10-01 00:04:37,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-01 00:04:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-01 00:04:37,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-01 00:04:37,005 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-10-01 00:04:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:37,442 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-01 00:04:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-01 00:04:37,443 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-10-01 00:04:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:37,445 INFO L225 Difference]: With dead ends: 279 [2018-10-01 00:04:37,445 INFO L226 Difference]: Without dead ends: 278 [2018-10-01 00:04:37,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-01 00:04:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-01 00:04:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-10-01 00:04:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-01 00:04:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-01 00:04:37,451 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-10-01 00:04:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:37,451 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-01 00:04:37,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-01 00:04:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-01 00:04:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-01 00:04:37,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:37,453 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-10-01 00:04:37,453 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:04:37,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-10-01 00:04:37,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:37,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:37,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:04:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:40,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-01 00:04:40,127 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:40,127 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-01 00:04:40,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:04:40,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:04:40,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:40,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:40,210 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-01 00:04:40,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:40,221 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-01 00:04:40,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:43,097 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-01 00:04:43,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:43,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-10-01 00:04:43,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-01 00:04:43,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-01 00:04:43,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-01 00:04:43,119 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-10-01 00:04:43,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:43,638 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-01 00:04:43,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:04:43,639 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-10-01 00:04:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:43,641 INFO L225 Difference]: With dead ends: 283 [2018-10-01 00:04:43,641 INFO L226 Difference]: Without dead ends: 282 [2018-10-01 00:04:43,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-01 00:04:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-01 00:04:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-10-01 00:04:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-01 00:04:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-01 00:04:43,648 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-10-01 00:04:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:43,648 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-01 00:04:43,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-01 00:04:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-01 00:04:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-01 00:04:43,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:43,650 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-10-01 00:04:43,650 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:04:43,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-10-01 00:04:43,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:43,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:43,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:43,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:43,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:46,347 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-01 00:04:46,347 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:46,347 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-01 00:04:46,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:04:46,725 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-01 00:04:46,726 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:46,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:46,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-01 00:04:46,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:46,745 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-01 00:04:46,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:49,643 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-01 00:04:49,663 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:49,664 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-10-01 00:04:49,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-01 00:04:49,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-01 00:04:49,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-01 00:04:49,667 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-10-01 00:04:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:50,168 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-01 00:04:50,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-01 00:04:50,168 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-10-01 00:04:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:50,170 INFO L225 Difference]: With dead ends: 287 [2018-10-01 00:04:50,170 INFO L226 Difference]: Without dead ends: 286 [2018-10-01 00:04:50,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-01 00:04:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-01 00:04:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-10-01 00:04:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-01 00:04:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-01 00:04:50,175 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-10-01 00:04:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:50,175 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-01 00:04:50,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-01 00:04:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-01 00:04:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-01 00:04:50,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:50,177 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-10-01 00:04:50,177 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:04:50,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:50,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-10-01 00:04:50,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:50,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:50,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:50,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:50,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:52,669 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-01 00:04:52,670 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:52,670 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-01 00:04:52,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:04:52,759 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:04:52,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:52,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:52,772 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-01 00:04:52,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:52,783 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-01 00:04:52,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:56,045 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-01 00:04:56,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:56,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-10-01 00:04:56,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-01 00:04:56,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-01 00:04:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-01 00:04:56,069 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-10-01 00:04:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:56,663 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-01 00:04:56,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-01 00:04:56,664 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-10-01 00:04:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:56,666 INFO L225 Difference]: With dead ends: 291 [2018-10-01 00:04:56,666 INFO L226 Difference]: Without dead ends: 290 [2018-10-01 00:04:56,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-01 00:04:56,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-01 00:04:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-10-01 00:04:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-01 00:04:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-01 00:04:56,672 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-10-01 00:04:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:56,672 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-01 00:04:56,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-01 00:04:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-01 00:04:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-01 00:04:56,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:56,673 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-10-01 00:04:56,673 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:04:56,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:56,674 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-10-01 00:04:56,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:56,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:56,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:56,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:59,216 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-01 00:04:59,216 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:59,216 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-01 00:04:59,224 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:04:59,445 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-01 00:04:59,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:59,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:59,455 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-01 00:04:59,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:59,462 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-01 00:04:59,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:02,866 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-01 00:05:02,888 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:02,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-10-01 00:05:02,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-01 00:05:02,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-01 00:05:02,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-01 00:05:02,892 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-10-01 00:05:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:03,416 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-01 00:05:03,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-01 00:05:03,417 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-10-01 00:05:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:03,419 INFO L225 Difference]: With dead ends: 295 [2018-10-01 00:05:03,419 INFO L226 Difference]: Without dead ends: 294 [2018-10-01 00:05:03,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-01 00:05:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-01 00:05:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-10-01 00:05:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-01 00:05:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-01 00:05:03,425 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-10-01 00:05:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:03,425 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-01 00:05:03,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-01 00:05:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-01 00:05:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-01 00:05:03,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:03,427 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-10-01 00:05:03,427 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:05:03,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-10-01 00:05:03,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:03,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:03,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:06,375 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-01 00:05:06,376 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:06,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 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-01 00:05:06,382 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:05:06,694 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-01 00:05:06,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:06,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:06,706 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-01 00:05:06,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:06,715 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-01 00:05:06,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:09,849 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-01 00:05:09,871 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:09,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-10-01 00:05:09,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-01 00:05:09,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-01 00:05:09,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-01 00:05:09,873 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-10-01 00:05:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:10,461 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-01 00:05:10,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-01 00:05:10,461 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-10-01 00:05:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:10,463 INFO L225 Difference]: With dead ends: 299 [2018-10-01 00:05:10,463 INFO L226 Difference]: Without dead ends: 298 [2018-10-01 00:05:10,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-01 00:05:10,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-01 00:05:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-10-01 00:05:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-01 00:05:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-01 00:05:10,469 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-10-01 00:05:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:10,469 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-01 00:05:10,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-01 00:05:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-01 00:05:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-01 00:05:10,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:10,471 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-10-01 00:05:10,471 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:05:10,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:10,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-10-01 00:05:10,471 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:10,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:10,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:10,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:10,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:13,292 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-01 00:05:13,293 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:13,293 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-01 00:05:13,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:05:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:13,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:13,382 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-01 00:05:13,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:13,395 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-01 00:05:13,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:16,886 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-01 00:05:16,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:16,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-10-01 00:05:16,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-10-01 00:05:16,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-10-01 00:05:16,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-01 00:05:16,908 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-10-01 00:05:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:17,390 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-01 00:05:17,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-01 00:05:17,391 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-10-01 00:05:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:17,393 INFO L225 Difference]: With dead ends: 303 [2018-10-01 00:05:17,393 INFO L226 Difference]: Without dead ends: 302 [2018-10-01 00:05:17,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-01 00:05:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-01 00:05:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-10-01 00:05:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-01 00:05:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-01 00:05:17,399 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-10-01 00:05:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:17,399 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-01 00:05:17,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-10-01 00:05:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-01 00:05:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-01 00:05:17,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:17,400 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-10-01 00:05:17,401 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:05:17,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-10-01 00:05:17,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:17,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:17,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:17,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:05:17,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:20,143 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-01 00:05:20,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:20,143 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-01 00:05:20,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:05:20,234 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:05:20,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:20,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:20,244 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-01 00:05:20,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:20,255 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-01 00:05:20,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:23,778 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-01 00:05:23,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:23,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-10-01 00:05:23,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-10-01 00:05:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-10-01 00:05:23,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-01 00:05:23,800 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-10-01 00:05:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:24,296 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-01 00:05:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-01 00:05:24,297 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-10-01 00:05:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:24,299 INFO L225 Difference]: With dead ends: 307 [2018-10-01 00:05:24,299 INFO L226 Difference]: Without dead ends: 306 [2018-10-01 00:05:24,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-01 00:05:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-01 00:05:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-10-01 00:05:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-01 00:05:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-01 00:05:24,305 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-10-01 00:05:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:24,305 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-01 00:05:24,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-10-01 00:05:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-01 00:05:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-01 00:05:24,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:24,306 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-10-01 00:05:24,307 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:05:24,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:24,307 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-10-01 00:05:24,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:24,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:24,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:24,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:24,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:27,336 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-01 00:05:27,336 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:27,336 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-01 00:05:27,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:05:27,787 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-01 00:05:27,787 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:27,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:27,798 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-01 00:05:27,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:27,806 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-01 00:05:27,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:31,504 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-01 00:05:31,525 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:31,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-10-01 00:05:31,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-10-01 00:05:31,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-10-01 00:05:31,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-01 00:05:31,528 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-10-01 00:05:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:32,064 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-01 00:05:32,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-01 00:05:32,064 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-10-01 00:05:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:32,066 INFO L225 Difference]: With dead ends: 311 [2018-10-01 00:05:32,066 INFO L226 Difference]: Without dead ends: 310 [2018-10-01 00:05:32,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-01 00:05:32,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-01 00:05:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-10-01 00:05:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-01 00:05:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-10-01 00:05:32,072 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-10-01 00:05:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:32,073 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-10-01 00:05:32,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-10-01 00:05:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-10-01 00:05:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-01 00:05:32,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:32,074 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-10-01 00:05:32,074 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:05:32,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-10-01 00:05:32,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:32,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:32,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:35,006 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-01 00:05:35,006 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:35,006 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-01 00:05:35,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:05:35,105 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:05:35,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:35,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:35,115 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-01 00:05:35,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:35,128 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-01 00:05:35,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:38,799 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-01 00:05:38,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:38,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 154 [2018-10-01 00:05:38,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-10-01 00:05:38,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-10-01 00:05:38,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-01 00:05:38,822 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2018-10-01 00:05:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:39,343 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-10-01 00:05:39,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:05:39,344 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2018-10-01 00:05:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:39,346 INFO L225 Difference]: With dead ends: 315 [2018-10-01 00:05:39,346 INFO L226 Difference]: Without dead ends: 314 [2018-10-01 00:05:39,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11704 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-01 00:05:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-01 00:05:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2018-10-01 00:05:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-01 00:05:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-10-01 00:05:39,354 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2018-10-01 00:05:39,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:39,354 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-10-01 00:05:39,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-10-01 00:05:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-10-01 00:05:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-01 00:05:39,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:39,356 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2018-10-01 00:05:39,356 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:05:39,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2018-10-01 00:05:39,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:39,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:39,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:39,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:39,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:42,582 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:42,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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:42,589 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:05:42,872 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-10-01 00:05:42,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:42,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:42,885 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-01 00:05:42,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:42,899 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-01 00:05:42,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:46,787 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:46,787 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 156 [2018-10-01 00:05:46,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-10-01 00:05:46,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-10-01 00:05:46,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-01 00:05:46,790 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2018-10-01 00:05:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:47,408 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-10-01 00:05:47,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-01 00:05:47,408 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2018-10-01 00:05:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:47,410 INFO L225 Difference]: With dead ends: 319 [2018-10-01 00:05:47,410 INFO L226 Difference]: Without dead ends: 318 [2018-10-01 00:05:47,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12012 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-01 00:05:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-01 00:05:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2018-10-01 00:05:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-01 00:05:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-01 00:05:47,417 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2018-10-01 00:05:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:47,417 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-01 00:05:47,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-10-01 00:05:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-01 00:05:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-01 00:05:47,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:47,418 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2018-10-01 00:05:47,418 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:05:47,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:47,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2018-10-01 00:05:47,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:47,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:47,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:47,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:47,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:50,488 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:50,488 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:50,495 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:05:50,851 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-10-01 00:05:50,851 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:50,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:50,875 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-01 00:05:50,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:50,884 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-01 00:05:50,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:54,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:54,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 158 [2018-10-01 00:05:54,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-10-01 00:05:54,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-10-01 00:05:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-01 00:05:54,798 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2018-10-01 00:05:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:55,360 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-01 00:05:55,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 00:05:55,360 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2018-10-01 00:05:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:55,362 INFO L225 Difference]: With dead ends: 323 [2018-10-01 00:05:55,362 INFO L226 Difference]: Without dead ends: 322 [2018-10-01 00:05:55,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12324 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-01 00:05:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-01 00:05:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2018-10-01 00:05:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-01 00:05:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-10-01 00:05:55,368 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2018-10-01 00:05:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:55,368 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-10-01 00:05:55,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-10-01 00:05:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-10-01 00:05:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-01 00:05:55,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:55,370 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2018-10-01 00:05:55,370 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:05:55,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2018-10-01 00:05:55,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:55,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:55,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:58,850 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:58,850 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:58,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:05:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:58,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:58,946 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-01 00:05:58,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:58,966 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-01 00:05:58,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:03,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:03,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 160 [2018-10-01 00:06:03,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-10-01 00:06:03,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-10-01 00:06:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-01 00:06:03,063 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2018-10-01 00:06:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:03,653 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-10-01 00:06:03,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 00:06:03,654 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2018-10-01 00:06:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:03,656 INFO L225 Difference]: With dead ends: 327 [2018-10-01 00:06:03,656 INFO L226 Difference]: Without dead ends: 326 [2018-10-01 00:06:03,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12640 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-01 00:06:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-01 00:06:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-10-01 00:06:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-01 00:06:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-10-01 00:06:03,662 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2018-10-01 00:06:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:03,663 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-10-01 00:06:03,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-10-01 00:06:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-10-01 00:06:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-01 00:06:03,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:03,664 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2018-10-01 00:06:03,664 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:06:03,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2018-10-01 00:06:03,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:03,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:03,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:06:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:07,046 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:07,046 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:07,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:06:07,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:06:07,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:07,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:07,149 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-01 00:06:07,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:07,157 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-01 00:06:07,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:11,036 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:11,036 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 162 [2018-10-01 00:06:11,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-10-01 00:06:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-10-01 00:06:11,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-01 00:06:11,039 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2018-10-01 00:06:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:11,661 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-01 00:06:11,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-01 00:06:11,662 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2018-10-01 00:06:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:11,664 INFO L225 Difference]: With dead ends: 331 [2018-10-01 00:06:11,664 INFO L226 Difference]: Without dead ends: 330 [2018-10-01 00:06:11,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12960 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-01 00:06:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-01 00:06:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2018-10-01 00:06:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-01 00:06:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-10-01 00:06:11,670 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2018-10-01 00:06:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:11,671 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-10-01 00:06:11,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-10-01 00:06:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-10-01 00:06:11,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-01 00:06:11,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:11,672 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2018-10-01 00:06:11,672 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:06:11,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2018-10-01 00:06:11,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:11,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:11,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:11,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:11,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:14,971 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:14,971 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:14,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:06:15,506 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-10-01 00:06:15,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:15,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:15,517 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-01 00:06:15,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:15,525 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-01 00:06:15,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:19,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:19,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 164 [2018-10-01 00:06:19,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-10-01 00:06:19,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-10-01 00:06:19,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-01 00:06:19,735 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2018-10-01 00:06:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:20,391 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-01 00:06:20,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-01 00:06:20,392 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2018-10-01 00:06:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:20,393 INFO L225 Difference]: With dead ends: 335 [2018-10-01 00:06:20,393 INFO L226 Difference]: Without dead ends: 334 [2018-10-01 00:06:20,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13284 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-01 00:06:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-01 00:06:20,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2018-10-01 00:06:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-01 00:06:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-01 00:06:20,399 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2018-10-01 00:06:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:20,399 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-01 00:06:20,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-10-01 00:06:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-01 00:06:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-01 00:06:20,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:20,401 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2018-10-01 00:06:20,401 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:06:20,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2018-10-01 00:06:20,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:20,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:20,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:20,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:20,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:24,160 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:24,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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:24,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:06:24,271 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:06:24,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:24,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06: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-01 00:06:24,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:24,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-01 00:06:24,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:28,492 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:28,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 166 [2018-10-01 00:06:28,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-10-01 00:06:28,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-10-01 00:06:28,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-01 00:06:28,495 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2018-10-01 00:06:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:29,093 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-10-01 00:06:29,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:06:29,094 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2018-10-01 00:06:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:29,096 INFO L225 Difference]: With dead ends: 339 [2018-10-01 00:06:29,096 INFO L226 Difference]: Without dead ends: 338 [2018-10-01 00:06:29,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13612 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-01 00:06:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-01 00:06:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2018-10-01 00:06:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-01 00:06:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-10-01 00:06:29,103 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2018-10-01 00:06:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:29,103 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-10-01 00:06:29,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-10-01 00:06:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-10-01 00:06:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-01 00:06:29,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:29,104 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2018-10-01 00:06:29,105 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:06:29,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:29,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2018-10-01 00:06:29,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:29,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:29,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:29,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:32,918 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:32,918 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:32,926 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:06:33,211 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-10-01 00:06:33,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:33,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:33,223 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-01 00:06:33,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:33,242 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-01 00:06:33,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:37,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:37,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 168 [2018-10-01 00:06:37,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-10-01 00:06:37,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-10-01 00:06:37,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-01 00:06:37,545 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2018-10-01 00:06:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:38,153 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-10-01 00:06:38,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-01 00:06:38,154 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2018-10-01 00:06:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:38,156 INFO L225 Difference]: With dead ends: 343 [2018-10-01 00:06:38,156 INFO L226 Difference]: Without dead ends: 342 [2018-10-01 00:06:38,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13944 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-01 00:06:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-01 00:06:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2018-10-01 00:06:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-01 00:06:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-10-01 00:06:38,163 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2018-10-01 00:06:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:38,164 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-10-01 00:06:38,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-10-01 00:06:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-10-01 00:06:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-01 00:06:38,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:38,165 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2018-10-01 00:06:38,165 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:06:38,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2018-10-01 00:06:38,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:38,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:38,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:38,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:38,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:41,677 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:41,677 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:41,685 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:06:42,079 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-10-01 00:06:42,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:42,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:42,090 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-01 00:06:42,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:42,101 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-01 00:06:42,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:46,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:46,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 170 [2018-10-01 00:06:46,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-10-01 00:06:46,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-10-01 00:06:46,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-01 00:06:46,566 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2018-10-01 00:06:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:47,207 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-10-01 00:06:47,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-01 00:06:47,208 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2018-10-01 00:06:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:47,210 INFO L225 Difference]: With dead ends: 347 [2018-10-01 00:06:47,210 INFO L226 Difference]: Without dead ends: 346 [2018-10-01 00:06:47,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14280 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-01 00:06:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-01 00:06:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2018-10-01 00:06:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-01 00:06:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-10-01 00:06:47,217 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2018-10-01 00:06:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:47,218 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-10-01 00:06:47,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-10-01 00:06:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-10-01 00:06:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-01 00:06:47,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:47,220 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2018-10-01 00:06:47,220 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:06:47,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:47,220 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2018-10-01 00:06:47,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:47,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:47,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:47,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:47,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:51,044 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:51,044 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:51,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:06:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:51,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:51,141 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-01 00:06:51,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:51,155 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-01 00:06:51,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:55,712 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:55,713 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 172 [2018-10-01 00:06:55,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-10-01 00:06:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-10-01 00:06:55,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-01 00:06:55,717 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2018-10-01 00:06:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:56,317 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-10-01 00:06:56,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-01 00:06:56,318 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2018-10-01 00:06:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:56,320 INFO L225 Difference]: With dead ends: 351 [2018-10-01 00:06:56,320 INFO L226 Difference]: Without dead ends: 350 [2018-10-01 00:06:56,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14620 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-01 00:06:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-01 00:06:56,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2018-10-01 00:06:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-01 00:06:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-10-01 00:06:56,327 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2018-10-01 00:06:56,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:56,328 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-10-01 00:06:56,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-10-01 00:06:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-10-01 00:06:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-01 00:06:56,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:56,329 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2018-10-01 00:06:56,329 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:06:56,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:56,329 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2018-10-01 00:06:56,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:56,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:56,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:56,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:06:56,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:00,260 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:00,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:00,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:07:00,355 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:07:00,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:00,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:00,366 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-01 00:07:00,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:00,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-01 00:07:00,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:04,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:04,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 174 [2018-10-01 00:07:04,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-10-01 00:07:04,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-10-01 00:07:04,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-01 00:07:04,940 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2018-10-01 00:07:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:05,566 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-10-01 00:07:05,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-01 00:07:05,566 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2018-10-01 00:07:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:05,569 INFO L225 Difference]: With dead ends: 355 [2018-10-01 00:07:05,569 INFO L226 Difference]: Without dead ends: 354 [2018-10-01 00:07:05,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14964 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-01 00:07:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-01 00:07:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2018-10-01 00:07:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-01 00:07:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-01 00:07:05,576 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2018-10-01 00:07:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:05,576 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-01 00:07:05,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-10-01 00:07:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-01 00:07:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-01 00:07:05,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:05,578 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2018-10-01 00:07:05,578 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:07:05,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2018-10-01 00:07:05,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:05,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:05,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:09,658 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:09,658 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:09,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:07:10,262 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-10-01 00:07:10,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:10,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:10,280 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-01 00:07:10,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:10,288 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-01 00:07:10,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:15,010 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:15,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 176 [2018-10-01 00:07:15,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-10-01 00:07:15,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-10-01 00:07:15,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-01 00:07:15,014 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2018-10-01 00:07:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:15,734 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-10-01 00:07:15,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-01 00:07:15,735 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2018-10-01 00:07:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:15,737 INFO L225 Difference]: With dead ends: 359 [2018-10-01 00:07:15,737 INFO L226 Difference]: Without dead ends: 358 [2018-10-01 00:07:15,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15312 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-01 00:07:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-01 00:07:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2018-10-01 00:07:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-01 00:07:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-10-01 00:07:15,743 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2018-10-01 00:07:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:15,744 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-10-01 00:07:15,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-10-01 00:07:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-10-01 00:07:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-01 00:07:15,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:15,745 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2018-10-01 00:07:15,745 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:07:15,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:15,746 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2018-10-01 00:07:15,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:15,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:15,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:15,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:15,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:19,872 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:19,872 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:19,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:07:19,986 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:07:19,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:19,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:20,000 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-01 00:07:20,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:20,008 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-01 00:07:20,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:24,875 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:24,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 178 [2018-10-01 00:07:24,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-10-01 00:07:24,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-10-01 00:07:24,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-01 00:07:24,880 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2018-10-01 00:07:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:25,750 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-10-01 00:07:25,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-01 00:07:25,750 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2018-10-01 00:07:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:25,752 INFO L225 Difference]: With dead ends: 363 [2018-10-01 00:07:25,752 INFO L226 Difference]: Without dead ends: 362 [2018-10-01 00:07:25,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15664 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-01 00:07:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-01 00:07:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2018-10-01 00:07:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-01 00:07:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-10-01 00:07:25,759 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2018-10-01 00:07:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:25,759 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-10-01 00:07:25,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-10-01 00:07:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-10-01 00:07:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-01 00:07:25,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:25,761 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2018-10-01 00:07:25,761 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:07:25,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:25,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2018-10-01 00:07:25,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:25,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:25,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:25,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:25,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:29,967 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:29,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:29,974 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:07:30,409 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-10-01 00:07:30,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:30,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:30,420 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-01 00:07:30,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:30,431 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-01 00:07:30,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:35,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:35,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 180 [2018-10-01 00:07:35,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-10-01 00:07:35,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-10-01 00:07:35,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-01 00:07:35,428 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2018-10-01 00:07:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:36,076 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-10-01 00:07:36,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-01 00:07:36,077 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2018-10-01 00:07:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:36,079 INFO L225 Difference]: With dead ends: 367 [2018-10-01 00:07:36,079 INFO L226 Difference]: Without dead ends: 366 [2018-10-01 00:07:36,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16020 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-01 00:07:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-10-01 00:07:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2018-10-01 00:07:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-01 00:07:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-10-01 00:07:36,087 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2018-10-01 00:07:36,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:36,087 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-10-01 00:07:36,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-10-01 00:07:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-10-01 00:07:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-10-01 00:07:36,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:36,088 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2018-10-01 00:07:36,089 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:07:36,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2018-10-01 00:07:36,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:36,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:36,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:40,270 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:40,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:40,278 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:07:40,759 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2018-10-01 00:07:40,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:40,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:40,770 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-01 00:07:40,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:40,778 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-01 00:07:40,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:45,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:45,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 182 [2018-10-01 00:07:45,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-10-01 00:07:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-10-01 00:07:45,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-01 00:07:45,794 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2018-10-01 00:07:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:46,562 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-10-01 00:07:46,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-01 00:07:46,563 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2018-10-01 00:07:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:46,565 INFO L225 Difference]: With dead ends: 371 [2018-10-01 00:07:46,565 INFO L226 Difference]: Without dead ends: 370 [2018-10-01 00:07:46,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16380 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-01 00:07:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-01 00:07:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2018-10-01 00:07:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-01 00:07:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2018-10-01 00:07:46,571 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2018-10-01 00:07:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:46,572 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2018-10-01 00:07:46,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-10-01 00:07:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2018-10-01 00:07:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-01 00:07:46,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:46,573 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2018-10-01 00:07:46,573 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:07:46,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:46,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2018-10-01 00:07:46,574 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:46,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:46,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:46,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:46,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:50,898 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:50,898 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:50,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:07:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:51,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:51,012 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-01 00:07:51,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:51,025 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-01 00:07:51,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:56,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:56,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 184 [2018-10-01 00:07:56,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-10-01 00:07:56,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-10-01 00:07:56,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-01 00:07:56,089 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2018-10-01 00:07:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:56,755 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-10-01 00:07:56,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-01 00:07:56,755 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2018-10-01 00:07:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:56,758 INFO L225 Difference]: With dead ends: 375 [2018-10-01 00:07:56,758 INFO L226 Difference]: Without dead ends: 374 [2018-10-01 00:07:56,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16744 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-01 00:07:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-01 00:07:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-10-01 00:07:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-01 00:07:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-10-01 00:07:56,764 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2018-10-01 00:07:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:56,765 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-10-01 00:07:56,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-10-01 00:07:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-10-01 00:07:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-01 00:07:56,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:56,766 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2018-10-01 00:07:56,766 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:07:56,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2018-10-01 00:07:56,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:56,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:56,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:56,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:07:56,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:01,354 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:01,354 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:01,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:08:01,467 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:08:01,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:01,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:01,477 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-01 00:08:01,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:01,485 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-01 00:08:01,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:06,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:06,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 186 [2018-10-01 00:08:06,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-10-01 00:08:06,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-10-01 00:08:06,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-01 00:08:06,715 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2018-10-01 00:08:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:07,479 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-10-01 00:08:07,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-01 00:08:07,479 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2018-10-01 00:08:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:07,482 INFO L225 Difference]: With dead ends: 379 [2018-10-01 00:08:07,482 INFO L226 Difference]: Without dead ends: 378 [2018-10-01 00:08:07,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17112 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-01 00:08:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-10-01 00:08:07,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2018-10-01 00:08:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-01 00:08:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-10-01 00:08:07,489 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2018-10-01 00:08:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:07,489 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-10-01 00:08:07,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-10-01 00:08:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-10-01 00:08:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-01 00:08:07,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:07,491 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2018-10-01 00:08:07,491 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:08:07,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2018-10-01 00:08:07,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:07,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:07,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:07,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:12,098 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:12,098 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:12,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:08:12,816 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-10-01 00:08:12,817 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:12,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:12,831 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-01 00:08:12,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:12,839 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-01 00:08:12,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:18,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:18,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 188 [2018-10-01 00:08:18,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-10-01 00:08:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-10-01 00:08:18,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-01 00:08:18,202 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2018-10-01 00:08:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:19,042 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-10-01 00:08:19,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-01 00:08:19,042 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2018-10-01 00:08:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:19,044 INFO L225 Difference]: With dead ends: 383 [2018-10-01 00:08:19,045 INFO L226 Difference]: Without dead ends: 382 [2018-10-01 00:08:19,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-01 00:08:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-01 00:08:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-10-01 00:08:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-01 00:08:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-10-01 00:08:19,052 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2018-10-01 00:08:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:19,052 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-10-01 00:08:19,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-10-01 00:08:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-10-01 00:08:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-01 00:08:19,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:19,053 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2018-10-01 00:08:19,053 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:08:19,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:19,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2018-10-01 00:08:19,054 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:19,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:19,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:19,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:19,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:23,536 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:23,536 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:08:23,660 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:08:23,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:23,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:23,671 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-01 00:08:23,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:23,679 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-01 00:08:23,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:29,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:29,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 190 [2018-10-01 00:08:29,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-10-01 00:08:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-10-01 00:08:29,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13871, Invalid=22801, Unknown=0, NotChecked=0, Total=36672 [2018-10-01 00:08:29,128 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2018-10-01 00:08:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:30,035 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-10-01 00:08:30,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-01 00:08:30,035 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2018-10-01 00:08:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:30,037 INFO L225 Difference]: With dead ends: 387 [2018-10-01 00:08:30,037 INFO L226 Difference]: Without dead ends: 386 [2018-10-01 00:08:30,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17860 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13871, Invalid=22801, Unknown=0, NotChecked=0, Total=36672 [2018-10-01 00:08:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-01 00:08:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2018-10-01 00:08:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-01 00:08:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-10-01 00:08:30,045 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2018-10-01 00:08:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:30,046 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-10-01 00:08:30,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-10-01 00:08:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-10-01 00:08:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-01 00:08:30,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:30,047 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2018-10-01 00:08:30,047 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:08:30,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:30,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2018-10-01 00:08:30,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:30,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:30,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:30,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:34,568 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:34,568 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:34,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:08:35,008 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2018-10-01 00:08:35,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:35,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:35,018 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-01 00:08:35,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:35,027 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-01 00:08:35,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:40,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:40,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 192 [2018-10-01 00:08:40,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-10-01 00:08:40,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-10-01 00:08:40,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14161, Invalid=23281, Unknown=0, NotChecked=0, Total=37442 [2018-10-01 00:08:40,650 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2018-10-01 00:08:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:41,482 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-10-01 00:08:41,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-01 00:08:41,483 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2018-10-01 00:08:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:41,485 INFO L225 Difference]: With dead ends: 391 [2018-10-01 00:08:41,485 INFO L226 Difference]: Without dead ends: 390 [2018-10-01 00:08:41,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18240 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14161, Invalid=23281, Unknown=0, NotChecked=0, Total=37442 [2018-10-01 00:08:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-01 00:08:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2018-10-01 00:08:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-01 00:08:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-01 00:08:41,493 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2018-10-01 00:08:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:41,493 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-01 00:08:41,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-10-01 00:08:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-01 00:08:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-01 00:08:41,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:41,495 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2018-10-01 00:08:41,496 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:08:41,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2018-10-01 00:08:41,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:41,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:41,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:41,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:41,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:46,334 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:46,335 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:46,341 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:08:46,877 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2018-10-01 00:08:46,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:46,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:46,892 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-01 00:08:46,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:46,900 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-01 00:08:46,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:52,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:52,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 194 [2018-10-01 00:08:52,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-10-01 00:08:52,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-10-01 00:08:52,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14454, Invalid=23766, Unknown=0, NotChecked=0, Total=38220 [2018-10-01 00:08:52,603 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2018-10-01 00:08:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:53,446 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-10-01 00:08:53,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-01 00:08:53,447 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2018-10-01 00:08:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:53,449 INFO L225 Difference]: With dead ends: 395 [2018-10-01 00:08:53,449 INFO L226 Difference]: Without dead ends: 394 [2018-10-01 00:08:53,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18624 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14454, Invalid=23766, Unknown=0, NotChecked=0, Total=38220 [2018-10-01 00:08:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-01 00:08:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2018-10-01 00:08:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-01 00:08:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-10-01 00:08:53,457 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2018-10-01 00:08:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:53,457 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-10-01 00:08:53,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-10-01 00:08:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-10-01 00:08:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-01 00:08:53,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:53,459 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2018-10-01 00:08:53,459 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:08:53,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:53,459 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2018-10-01 00:08:53,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:53,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:53,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:53,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:53,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:58,211 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:58,211 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:58,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:08:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:58,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:58,328 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-01 00:08:58,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:58,341 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-01 00:08:58,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:09:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:04,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:09:04,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 196 [2018-10-01 00:09:04,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-10-01 00:09:04,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-10-01 00:09:04,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14750, Invalid=24256, Unknown=0, NotChecked=0, Total=39006 [2018-10-01 00:09:04,188 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2018-10-01 00:09:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:04,974 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-10-01 00:09:04,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-01 00:09:04,974 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2018-10-01 00:09:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:04,976 INFO L225 Difference]: With dead ends: 399 [2018-10-01 00:09:04,976 INFO L226 Difference]: Without dead ends: 398 [2018-10-01 00:09:04,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19012 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14750, Invalid=24256, Unknown=0, NotChecked=0, Total=39006 [2018-10-01 00:09:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-01 00:09:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2018-10-01 00:09:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-01 00:09:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-10-01 00:09:04,983 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2018-10-01 00:09:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:04,983 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-10-01 00:09:04,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-10-01 00:09:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-10-01 00:09:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-01 00:09:04,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:04,985 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2018-10-01 00:09:04,985 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:09:04,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2018-10-01 00:09:04,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:04,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:04,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:09:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:09,955 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:09:09,956 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:09:09,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:09:10,060 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:09:10,060 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:09:10,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:09:10,071 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-01 00:09:10,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:09:10,082 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-01 00:09:10,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:09:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:16,214 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:09:16,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 198 [2018-10-01 00:09:16,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-10-01 00:09:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-10-01 00:09:16,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15049, Invalid=24751, Unknown=0, NotChecked=0, Total=39800 [2018-10-01 00:09:16,218 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2018-10-01 00:09:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:17,035 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-10-01 00:09:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-01 00:09:17,035 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2018-10-01 00:09:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:17,037 INFO L225 Difference]: With dead ends: 403 [2018-10-01 00:09:17,037 INFO L226 Difference]: Without dead ends: 402 [2018-10-01 00:09:17,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19404 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=15049, Invalid=24751, Unknown=0, NotChecked=0, Total=39800 [2018-10-01 00:09:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-01 00:09:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2018-10-01 00:09:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-01 00:09:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-10-01 00:09:17,044 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2018-10-01 00:09:17,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:17,045 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-10-01 00:09:17,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-10-01 00:09:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-10-01 00:09:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-01 00:09:17,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:17,046 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2018-10-01 00:09:17,046 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:09:17,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:17,047 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2018-10-01 00:09:17,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:17,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:17,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:09:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:21,991 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:09:21,991 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:09:21,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:09:22,823 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-10-01 00:09:22,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:09:22,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:09:22,837 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-01 00:09:22,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:09:22,849 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-01 00:09:22,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:09:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:28,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:09:28,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 200 [2018-10-01 00:09:28,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-10-01 00:09:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-10-01 00:09:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2018-10-01 00:09:28,861 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2018-10-01 00:09:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:29,804 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-10-01 00:09:29,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-01 00:09:29,804 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2018-10-01 00:09:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:29,807 INFO L225 Difference]: With dead ends: 407 [2018-10-01 00:09:29,807 INFO L226 Difference]: Without dead ends: 406 [2018-10-01 00:09:29,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19800 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2018-10-01 00:09:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-01 00:09:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2018-10-01 00:09:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-01 00:09:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-10-01 00:09:29,815 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2018-10-01 00:09:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:29,815 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-10-01 00:09:29,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-10-01 00:09:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-10-01 00:09:29,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-01 00:09:29,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:29,817 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2018-10-01 00:09:29,817 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:09:29,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:29,818 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2018-10-01 00:09:29,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:29,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:29,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:29,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:09:29,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:34,971 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:09:34,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-10-01 00:09:34,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-01 00:09:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-01 00:09:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-10-01 00:09:34,973 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 103 states. [2018-10-01 00:09:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:35,747 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2018-10-01 00:09:35,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-01 00:09:35,748 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 404 [2018-10-01 00:09:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:35,749 INFO L225 Difference]: With dead ends: 408 [2018-10-01 00:09:35,749 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:09:35,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-10-01 00:09:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:09:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:09:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:09:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:09:35,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2018-10-01 00:09:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:35,753 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:09:35,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-01 00:09:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:09:35,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:09:35,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:09:35,928 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2018-10-01 00:09:39,158 WARN L178 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2018-10-01 00:09:39,164 INFO L426 ceAbstractionStarter]: For program point mainENTRY(lines 2 23) no Hoare annotation was computed. [2018-10-01 00:09:39,164 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 15) no Hoare annotation was computed. [2018-10-01 00:09:39,164 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 2 23) no Hoare annotation was computed. [2018-10-01 00:09:39,164 INFO L426 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-10-01 00:09:39,164 INFO L426 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2018-10-01 00:09:39,164 INFO L426 ceAbstractionStarter]: For program point L14-1(lines 14 19) no Hoare annotation was computed. [2018-10-01 00:09:39,167 INFO L422 ceAbstractionStarter]: At program point L12-1(lines 12 21) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2018-10-01 00:09:39,167 INFO L426 ceAbstractionStarter]: For program point L12-2(lines 2 23) no Hoare annotation was computed. [2018-10-01 00:09:39,237 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:09:39 BoogieIcfgContainer [2018-10-01 00:09:39,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:09:39,238 INFO L168 Benchmark]: Toolchain (without parser) took 485513.12 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 951.0 MB. Max. memory is 7.1 GB. [2018-10-01 00:09:39,242 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-01 00:09:39,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.47 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-01 00:09:39,242 INFO L168 Benchmark]: Boogie Preprocessor took 20.15 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-01 00:09:39,242 INFO L168 Benchmark]: RCFGBuilder took 346.24 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-01 00:09:39,243 INFO L168 Benchmark]: TraceAbstraction took 485081.09 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 929.9 MB. Max. memory is 7.1 GB. [2018-10-01 00:09:39,247 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 59.47 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 20.15 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 346.24 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 485081.09 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 929.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset <= q!offset && q!offset <= 0) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 484.9s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 41.6s AutomataDifference, 0.0s DeadEndRemovalTime, 3.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 7405 SDslu, 7612 SDs, 0 SdLazy, 27514 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25249 GetRequests, 15049 SyntacticMatches, 0 SemanticMatches, 10200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666600 ImplicationChecksByTransitivity, 387.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 16.2s SatisfiabilityAnalysisTime, 410.7s InterpolantComputationTime, 40800 NumberOfCodeBlocks, 40800 NumberOfCodeBlocksAsserted, 2716 NumberOfCheckSat, 40600 ConstructedInterpolants, 0 QuantifiedInterpolants, 86779928 SizeOfPredicates, 594 NumberOfNonLiveVariables, 36927 ConjunctsInSsa, 15840 ConjunctsInUnsatCore, 200 InterpolantComputations, 2 PerfectInterpolantSequences, 20100/1343400 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-09-39-297.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-09-39-297.csv Received shutdown request...