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/DivisibilityInterpolantRequired01-BackwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:50:34,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:50:34,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:50:34,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:50:34,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:50:34,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:50:34,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:50:34,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:50:34,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:50:34,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:50:34,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:50:34,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:50:34,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:50:34,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:50:34,688 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:50:34,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:50:34,690 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:50:34,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:50:34,703 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:50:34,705 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:50:34,706 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:50:34,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:50:34,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:50:34,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:50:34,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:50:34,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:50:34,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:50:34,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:50:34,720 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:50:34,724 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:50:34,724 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:50:34,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:50:34,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:50:34,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:50:34,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:50:34,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:50:34,727 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-02 11:50:34,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:50:34,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:50:34,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:50:34,744 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:50:34,744 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:50:34,747 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:50:34,748 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:50:34,748 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:50:34,748 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:50:34,748 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:50:34,748 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:50:34,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:50:34,749 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:50:34,749 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:50:34,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:50:34,750 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:50:34,750 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:50:34,750 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:50:34,750 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:50:34,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:50:34,751 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:50:34,751 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:50:34,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:50:34,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:50:34,751 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:50:34,752 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:50:34,752 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:50:34,752 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:50:34,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:50:34,754 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:50:34,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:50:34,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:50:34,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:50:34,824 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:50:34,824 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:50:34,825 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-10-02 11:50:34,825 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl' [2018-10-02 11:50:34,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:50:34,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:50:34,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:50:34,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:50:34,875 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:50:34,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (1/1) ... [2018-10-02 11:50:34,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (1/1) ... [2018-10-02 11:50:34,915 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 11:50:34,916 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 11:50:34,916 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 11:50:34,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:50:34,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:50:34,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:50:34,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:50:34,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (1/1) ... [2018-10-02 11:50:34,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (1/1) ... [2018-10-02 11:50:34,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (1/1) ... [2018-10-02 11:50:34,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (1/1) ... [2018-10-02 11:50:34,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (1/1) ... [2018-10-02 11:50:34,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (1/1) ... [2018-10-02 11:50:34,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (1/1) ... [2018-10-02 11:50:34,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:50:34,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:50:34,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:50:34,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:50:34,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (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-02 11:50:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-10-02 11:50:35,023 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-10-02 11:50:35,223 INFO L337 CfgBuilder]: Using library mode [2018-10-02 11:50:35,224 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:50:35 BoogieIcfgContainer [2018-10-02 11:50:35,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:50:35,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:50:35,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:50:35,231 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:50:35,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:50:34" (1/2) ... [2018-10-02 11:50:35,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df11ab4 and model type DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:50:35, skipping insertion in model container [2018-10-02 11:50:35,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:50:35" (2/2) ... [2018-10-02 11:50:35,235 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-10-02 11:50:35,245 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:50:35,254 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:50:35,302 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:50:35,304 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:50:35,304 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:50:35,304 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:50:35,304 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:50:35,304 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:50:35,305 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:50:35,305 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:50:35,305 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:50:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-02 11:50:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-02 11:50:35,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:35,326 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-02 11:50:35,328 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:35,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:35,334 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-02 11:50:35,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:35,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:35,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:35,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:35,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:35,510 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-02 11:50:35,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:50:35,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-02 11:50:35,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:50:35,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:50:35,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:50:35,534 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-02 11:50:35,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:35,568 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-02 11:50:35,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:50:35,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-02 11:50:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:35,590 INFO L225 Difference]: With dead ends: 9 [2018-10-02 11:50:35,592 INFO L226 Difference]: Without dead ends: 4 [2018-10-02 11:50:35,597 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-02 11:50:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-02 11:50:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-02 11:50:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-02 11:50:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-02 11:50:35,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-02 11:50:35,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:35,667 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-02 11:50:35,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:50:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-02 11:50:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-02 11:50:35,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:35,668 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-02 11:50:35,668 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:35,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-02 11:50:35,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:35,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:35,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:35,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:35,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:35,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:35,789 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-02 11:50:35,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:35,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:35,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:35,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-10-02 11:50:35,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:50:35,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:50:35,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:50:35,911 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-10-02 11:50:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:35,961 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-02 11:50:35,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:50:35,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-10-02 11:50:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:35,963 INFO L225 Difference]: With dead ends: 6 [2018-10-02 11:50:35,964 INFO L226 Difference]: Without dead ends: 5 [2018-10-02 11:50:35,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:50:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-02 11:50:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-02 11:50:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-02 11:50:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-02 11:50:35,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-02 11:50:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:35,968 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-02 11:50:35,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:50:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-02 11:50:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 11:50:35,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:35,969 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-02 11:50:35,969 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:35,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-02 11:50:35,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:35,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:35,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:36,059 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-02 11:50:36,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:36,060 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-02 11:50:36,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:50:36,076 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:50:36,076 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:36,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:36,097 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-02 11:50:36,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:36,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-02 11:50:36,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:50:36,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:50:36,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:50:36,121 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-10-02 11:50:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:36,186 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-02 11:50:36,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:50:36,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-02 11:50:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:36,187 INFO L225 Difference]: With dead ends: 7 [2018-10-02 11:50:36,187 INFO L226 Difference]: Without dead ends: 6 [2018-10-02 11:50:36,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:50:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-02 11:50:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-02 11:50:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-02 11:50:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-02 11:50:36,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-02 11:50:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:36,192 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-02 11:50:36,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:50:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-02 11:50:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:50:36,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:36,193 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-02 11:50:36,193 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:36,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:36,194 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-02 11:50:36,194 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:36,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:36,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:36,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:36,506 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-02 11:50:36,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:50:36,544 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 11:50:36,544 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:36,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:36,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:36,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 11:50:36,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 11:50:36,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 11:50:36,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:50:36,577 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-10-02 11:50:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:36,658 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-02 11:50:36,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:50:36,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-02 11:50:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:36,661 INFO L225 Difference]: With dead ends: 8 [2018-10-02 11:50:36,661 INFO L226 Difference]: Without dead ends: 7 [2018-10-02 11:50:36,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:50:36,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-02 11:50:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-02 11:50:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-02 11:50:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-02 11:50:36,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-02 11:50:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:36,665 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-02 11:50:36,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 11:50:36,665 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-02 11:50:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 11:50:36,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:36,665 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-02 11:50:36,666 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:36,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-02 11:50:36,666 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:36,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:36,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:36,802 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-02 11:50:36,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:36,803 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-02 11:50:36,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:50:36,829 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:50:36,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:36,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:36,841 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-02 11:50:36,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:36,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-02 11:50:36,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:50:36,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:50:36,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:50:36,863 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-10-02 11:50:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:37,031 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-02 11:50:37,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:50:37,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-02 11:50:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:37,034 INFO L225 Difference]: With dead ends: 9 [2018-10-02 11:50:37,035 INFO L226 Difference]: Without dead ends: 8 [2018-10-02 11:50:37,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:50:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-02 11:50:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-02 11:50:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-02 11:50:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-02 11:50:37,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-02 11:50:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:37,041 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-02 11:50:37,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:50:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-02 11:50:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:50:37,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:37,042 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-02 11:50:37,042 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:37,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:37,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-02 11:50:37,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:37,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:37,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:37,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:37,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:37,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:37,197 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-02 11:50:37,206 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:50:37,212 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-02 11:50:37,212 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:37,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:37,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:37,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 11:50:37,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:50:37,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:50:37,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:50:37,249 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-10-02 11:50:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:37,352 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-02 11:50:37,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 11:50:37,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-02 11:50:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:37,354 INFO L225 Difference]: With dead ends: 10 [2018-10-02 11:50:37,354 INFO L226 Difference]: Without dead ends: 9 [2018-10-02 11:50:37,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:50:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-02 11:50:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-02 11:50:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-02 11:50:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-02 11:50:37,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-02 11:50:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:37,359 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-02 11:50:37,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:50:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-02 11:50:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:50:37,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:37,360 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-02 11:50:37,361 INFO L423 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:37,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-02 11:50:37,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:37,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:37,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:37,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:37,835 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-02 11:50:37,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:37,835 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-02 11:50:37,845 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:50:37,851 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-02 11:50:37,851 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:37,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:37,861 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-02 11:50:37,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:37,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:50:37,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:50:37,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:50:37,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:50:37,883 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-10-02 11:50:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:38,022 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-02 11:50:38,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:50:38,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-10-02 11:50:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:38,024 INFO L225 Difference]: With dead ends: 11 [2018-10-02 11:50:38,024 INFO L226 Difference]: Without dead ends: 10 [2018-10-02 11:50:38,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:50:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-02 11:50:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-02 11:50:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-02 11:50:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-02 11:50:38,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-02 11:50:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:38,029 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-02 11:50:38,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:50:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-02 11:50:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:50:38,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:38,029 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-02 11:50:38,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:38,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:38,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-02 11:50:38,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:38,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:38,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:38,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:38,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:38,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:38,195 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-02 11:50:38,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:38,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:38,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:38,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-02 11:50:38,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:50:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:50:38,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:50:38,242 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-10-02 11:50:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:38,352 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-02 11:50:38,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:50:38,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-10-02 11:50:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:38,354 INFO L225 Difference]: With dead ends: 12 [2018-10-02 11:50:38,354 INFO L226 Difference]: Without dead ends: 11 [2018-10-02 11:50:38,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:50:38,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-02 11:50:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-02 11:50:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-02 11:50:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-02 11:50:38,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-02 11:50:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:38,359 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-02 11:50:38,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:50:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-02 11:50:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:50:38,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:38,360 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-02 11:50:38,360 INFO L423 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:38,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-02 11:50:38,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:38,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:38,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:38,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:38,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:38,572 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-02 11:50:38,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:38,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 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-02 11:50:38,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:50:38,602 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:50:38,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:38,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:38,611 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-02 11:50:38,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:38,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-02 11:50:38,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:50:38,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:50:38,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:50:38,636 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-10-02 11:50:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:38,767 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-02 11:50:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:50:38,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-10-02 11:50:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:38,775 INFO L225 Difference]: With dead ends: 13 [2018-10-02 11:50:38,775 INFO L226 Difference]: Without dead ends: 12 [2018-10-02 11:50:38,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:50:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-02 11:50:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-02 11:50:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-02 11:50:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-02 11:50:38,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-02 11:50:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:38,780 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-02 11:50:38,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:50:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-02 11:50:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:50:38,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:38,781 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-02 11:50:38,781 INFO L423 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:38,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-02 11:50:38,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:38,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:38,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:38,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:38,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:38,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:38,996 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-02 11:50:39,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:50:39,013 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-02 11:50:39,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:39,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:39,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:39,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-02 11:50:39,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:50:39,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:50:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:50:39,083 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-10-02 11:50:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:39,206 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-02 11:50:39,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:50:39,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-02 11:50:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:39,207 INFO L225 Difference]: With dead ends: 14 [2018-10-02 11:50:39,207 INFO L226 Difference]: Without dead ends: 13 [2018-10-02 11:50:39,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:50:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-02 11:50:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-02 11:50:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-02 11:50:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-02 11:50:39,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-02 11:50:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:39,211 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-02 11:50:39,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:50:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-02 11:50:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:50:39,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:39,212 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-02 11:50:39,212 INFO L423 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:39,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-02 11:50:39,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:39,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:39,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:39,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:39,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:39,387 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-02 11:50:39,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:39,388 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-02 11:50:39,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:50:39,412 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:50:39,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:39,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:39,434 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-02 11:50:39,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:39,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-02 11:50:39,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:50:39,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:50:39,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:50:39,458 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-10-02 11:50:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:39,591 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-02 11:50:39,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:50:39,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-02 11:50:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:39,593 INFO L225 Difference]: With dead ends: 15 [2018-10-02 11:50:39,593 INFO L226 Difference]: Without dead ends: 14 [2018-10-02 11:50:39,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:50:39,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-02 11:50:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-02 11:50:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-02 11:50:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-02 11:50:39,598 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-02 11:50:39,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:39,598 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-02 11:50:39,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:50:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-02 11:50:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:50:39,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:39,599 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-02 11:50:39,599 INFO L423 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:39,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:39,600 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-02 11:50:39,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:39,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:39,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:39,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:39,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:39,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:39,815 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-02 11:50:39,831 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:50:39,848 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-02 11:50:39,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:39,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:39,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:39,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-02 11:50:39,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:50:39,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:50:39,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:50:39,897 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-10-02 11:50:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:40,248 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-02 11:50:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:50:40,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 11:50:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:40,249 INFO L225 Difference]: With dead ends: 16 [2018-10-02 11:50:40,249 INFO L226 Difference]: Without dead ends: 15 [2018-10-02 11:50:40,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:50:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-02 11:50:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-02 11:50:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-02 11:50:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-02 11:50:40,256 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-02 11:50:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:40,257 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-02 11:50:40,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:50:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-02 11:50:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 11:50:40,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:40,258 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-02 11:50:40,258 INFO L423 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:40,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-02 11:50:40,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:40,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:40,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:40,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:40,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:40,540 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-02 11:50:40,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:40,541 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-02 11:50:40,551 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:50:40,570 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-02 11:50:40,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:40,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:40,587 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-02 11:50:40,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:40,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-02 11:50:40,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:50:40,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:50:40,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:50:40,613 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-10-02 11:50:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:40,802 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-02 11:50:40,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:50:40,802 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-02 11:50:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:40,803 INFO L225 Difference]: With dead ends: 17 [2018-10-02 11:50:40,803 INFO L226 Difference]: Without dead ends: 16 [2018-10-02 11:50:40,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:50:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-02 11:50:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-02 11:50:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-02 11:50:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-02 11:50:40,809 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-02 11:50:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:40,809 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-02 11:50:40,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:50:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-02 11:50:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:50:40,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:40,810 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-02 11:50:40,810 INFO L423 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:40,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:40,810 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-02 11:50:40,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:40,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:40,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:40,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:41,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:41,081 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-02 11:50:41,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:41,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:41,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:41,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-02 11:50:41,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:50:41,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:50:41,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:50:41,131 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-10-02 11:50:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:41,398 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-02 11:50:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:50:41,399 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-02 11:50:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:41,400 INFO L225 Difference]: With dead ends: 18 [2018-10-02 11:50:41,400 INFO L226 Difference]: Without dead ends: 17 [2018-10-02 11:50:41,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:50:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-02 11:50:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-02 11:50:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-02 11:50:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-02 11:50:41,404 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-02 11:50:41,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:41,405 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-02 11:50:41,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:50:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-02 11:50:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:50:41,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:41,405 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-02 11:50:41,406 INFO L423 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:41,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:41,406 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-02 11:50:41,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:41,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:41,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:41,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:41,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:41,667 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-02 11:50:41,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:41,667 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 11:50:41,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:50:41,683 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:50:41,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:41,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:41,693 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-02 11:50:41,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:41,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-02 11:50:41,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:50:41,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:50:41,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:50:41,728 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-10-02 11:50:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:42,175 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-02 11:50:42,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:50:42,175 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 11:50:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:42,176 INFO L225 Difference]: With dead ends: 19 [2018-10-02 11:50:42,177 INFO L226 Difference]: Without dead ends: 18 [2018-10-02 11:50:42,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:50:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-02 11:50:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-02 11:50:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-02 11:50:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-02 11:50:42,183 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-02 11:50:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:42,184 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-02 11:50:42,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:50:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-02 11:50:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:50:42,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:42,185 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-02 11:50:42,185 INFO L423 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:42,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-02 11:50:42,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:42,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:42,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:42,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:42,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:42,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:42,440 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 11:50:42,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:50:42,471 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-02 11:50:42,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:42,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:42,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:42,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-02 11:50:42,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:50:42,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:50:42,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:50:42,515 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-10-02 11:50:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:42,714 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-02 11:50:42,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:50:42,715 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-10-02 11:50:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:42,716 INFO L225 Difference]: With dead ends: 20 [2018-10-02 11:50:42,716 INFO L226 Difference]: Without dead ends: 19 [2018-10-02 11:50:42,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:50:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-02 11:50:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-02 11:50:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-02 11:50:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-02 11:50:42,721 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-02 11:50:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:42,722 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-02 11:50:42,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:50:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-02 11:50:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:50:42,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:42,723 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-02 11:50:42,723 INFO L423 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:42,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:42,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-02 11:50:42,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:42,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:42,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:42,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:42,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:43,080 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-02 11:50:43,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:43,081 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-02 11:50:43,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:50:43,093 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:50:43,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:43,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:43,103 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-02 11:50:43,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:43,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-02 11:50:43,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 11:50:43,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 11:50:43,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:50:43,125 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-10-02 11:50:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:43,380 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-02 11:50:43,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 11:50:43,381 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-02 11:50:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:43,381 INFO L225 Difference]: With dead ends: 21 [2018-10-02 11:50:43,382 INFO L226 Difference]: Without dead ends: 20 [2018-10-02 11:50:43,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:50:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-02 11:50:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-02 11:50:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-02 11:50:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-02 11:50:43,387 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-02 11:50:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:43,388 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-02 11:50:43,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 11:50:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-02 11:50:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-02 11:50:43,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:43,388 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-02 11:50:43,389 INFO L423 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:43,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-02 11:50:43,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:43,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:43,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:43,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:43,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:44,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:44,081 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-02 11:50:44,089 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:50:44,108 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-02 11:50:44,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:44,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:44,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:44,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-02 11:50:44,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 11:50:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 11:50:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:50:44,159 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-10-02 11:50:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:44,465 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-02 11:50:44,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 11:50:44,466 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-10-02 11:50:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:44,466 INFO L225 Difference]: With dead ends: 22 [2018-10-02 11:50:44,467 INFO L226 Difference]: Without dead ends: 21 [2018-10-02 11:50:44,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:50:44,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-02 11:50:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-02 11:50:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-02 11:50:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-02 11:50:44,472 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-02 11:50:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:44,472 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-02 11:50:44,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 11:50:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-02 11:50:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:50:44,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:44,473 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-02 11:50:44,473 INFO L423 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:44,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:44,474 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-02 11:50:44,474 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:44,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:44,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:44,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:44,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:44,859 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-02 11:50:44,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:44,860 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-02 11:50:44,869 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:50:44,915 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-02 11:50:44,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:44,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:44,925 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-02 11:50:44,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:44,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-02 11:50:44,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 11:50:44,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 11:50:44,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:50:44,946 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-10-02 11:50:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:45,298 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-02 11:50:45,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:50:45,298 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-10-02 11:50:45,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:45,299 INFO L225 Difference]: With dead ends: 23 [2018-10-02 11:50:45,299 INFO L226 Difference]: Without dead ends: 22 [2018-10-02 11:50:45,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:50:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-02 11:50:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-02 11:50:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-02 11:50:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-02 11:50:45,305 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-02 11:50:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:45,306 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-02 11:50:45,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 11:50:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-02 11:50:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:50:45,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:45,307 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-02 11:50:45,307 INFO L423 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:45,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:45,307 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-02 11:50:45,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:45,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:45,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:45,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:45,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:45,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:45,611 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-02 11:50:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:45,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:45,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:45,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-02 11:50:45,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-02 11:50:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-02 11:50:45,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:50:45,665 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-10-02 11:50:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:46,029 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-02 11:50:46,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 11:50:46,030 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-10-02 11:50:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:46,031 INFO L225 Difference]: With dead ends: 24 [2018-10-02 11:50:46,031 INFO L226 Difference]: Without dead ends: 23 [2018-10-02 11:50:46,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:50:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-02 11:50:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-02 11:50:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-02 11:50:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-02 11:50:46,037 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-02 11:50:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:46,038 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-02 11:50:46,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-02 11:50:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-02 11:50:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:50:46,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:46,039 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-02 11:50:46,039 INFO L423 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:46,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:46,040 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-02 11:50:46,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:46,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:46,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:46,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:46,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:46,901 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-02 11:50:46,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:46,901 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-02 11:50:46,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:50:46,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:50:46,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:46,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:46,928 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-02 11:50:46,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:46,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-02 11:50:46,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-02 11:50:46,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-02 11:50:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:50:46,954 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-10-02 11:50:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:47,318 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-02 11:50:47,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:50:47,318 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-10-02 11:50:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:47,319 INFO L225 Difference]: With dead ends: 25 [2018-10-02 11:50:47,320 INFO L226 Difference]: Without dead ends: 24 [2018-10-02 11:50:47,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:50:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-02 11:50:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-02 11:50:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-02 11:50:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-02 11:50:47,325 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-02 11:50:47,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:47,325 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-02 11:50:47,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-02 11:50:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-02 11:50:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 11:50:47,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:47,326 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-02 11:50:47,326 INFO L423 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:47,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:47,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-02 11:50:47,327 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:47,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:47,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:47,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:47,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:47,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:47,763 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-02 11:50:47,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:50:47,785 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-02 11:50:47,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:47,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:47,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:47,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-02 11:50:47,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-02 11:50:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-02 11:50:47,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:50:47,843 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-10-02 11:50:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:48,249 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-02 11:50:48,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:50:48,251 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-10-02 11:50:48,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:48,252 INFO L225 Difference]: With dead ends: 26 [2018-10-02 11:50:48,252 INFO L226 Difference]: Without dead ends: 25 [2018-10-02 11:50:48,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:50:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-02 11:50:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-02 11:50:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-02 11:50:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-02 11:50:48,256 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-02 11:50:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:48,257 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-02 11:50:48,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-02 11:50:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-02 11:50:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 11:50:48,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:48,258 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-02 11:50:48,258 INFO L423 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:48,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:48,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-02 11:50:48,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:48,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:48,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:48,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:48,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:48,690 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-02 11:50:48,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:48,690 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-02 11:50:48,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:50:48,706 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:50:48,706 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:48,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:48,775 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-02 11:50:48,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:48,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-02 11:50:48,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-02 11:50:48,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-02 11:50:48,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:50:48,808 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-10-02 11:50:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:49,384 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-02 11:50:49,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 11:50:49,385 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-10-02 11:50:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:49,386 INFO L225 Difference]: With dead ends: 27 [2018-10-02 11:50:49,386 INFO L226 Difference]: Without dead ends: 26 [2018-10-02 11:50:49,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:50:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-02 11:50:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-02 11:50:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-02 11:50:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-02 11:50:49,391 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-02 11:50:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:49,392 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-02 11:50:49,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-02 11:50:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-02 11:50:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 11:50:49,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:49,392 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-02 11:50:49,393 INFO L423 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:49,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:49,393 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-02 11:50:49,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:49,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:49,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:49,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:49,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:49,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:49,788 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-02 11:50:49,797 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:50:49,810 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-02 11:50:49,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:49,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:49,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:49,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-02 11:50:49,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-02 11:50:49,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-02 11:50:49,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:50:49,854 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-10-02 11:50:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:50,796 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-02 11:50:50,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 11:50:50,797 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-10-02 11:50:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:50,798 INFO L225 Difference]: With dead ends: 28 [2018-10-02 11:50:50,798 INFO L226 Difference]: Without dead ends: 27 [2018-10-02 11:50:50,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:50:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-02 11:50:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-02 11:50:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-02 11:50:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-02 11:50:50,801 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-02 11:50:50,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:50,801 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-02 11:50:50,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-02 11:50:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-02 11:50:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 11:50:50,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:50,802 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-02 11:50:50,803 INFO L423 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:50,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:50,803 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-02 11:50:50,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:50,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:50,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:50,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:50,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:51,285 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-02 11:50:51,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:51,286 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-02 11:50:51,294 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:50:51,307 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-02 11:50:51,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:51,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:51,319 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-02 11:50:51,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:51,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-02 11:50:51,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-02 11:50:51,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-02 11:50:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:50:51,341 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-10-02 11:50:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:51,831 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-02 11:50:51,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:50:51,832 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-10-02 11:50:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:51,832 INFO L225 Difference]: With dead ends: 29 [2018-10-02 11:50:51,833 INFO L226 Difference]: Without dead ends: 28 [2018-10-02 11:50:51,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:50:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-02 11:50:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-02 11:50:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-02 11:50:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-02 11:50:51,838 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-02 11:50:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:51,838 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-02 11:50:51,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-02 11:50:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-02 11:50:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-02 11:50:51,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:51,839 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-02 11:50:51,839 INFO L423 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:51,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-02 11:50:51,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:51,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:51,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:52,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:52,331 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-02 11:50:52,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:52,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:52,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:52,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-02 11:50:52,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-02 11:50:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-02 11:50:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-02 11:50:52,389 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-10-02 11:50:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:52,864 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-02 11:50:52,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 11:50:52,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-10-02 11:50:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:52,865 INFO L225 Difference]: With dead ends: 30 [2018-10-02 11:50:52,865 INFO L226 Difference]: Without dead ends: 29 [2018-10-02 11:50:52,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-02 11:50:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-02 11:50:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-02 11:50:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-02 11:50:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-02 11:50:52,870 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-02 11:50:52,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:52,870 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-02 11:50:52,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-02 11:50:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-02 11:50:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 11:50:52,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:52,871 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-02 11:50:52,872 INFO L423 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:52,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-02 11:50:52,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:52,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:52,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:52,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:50:52,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:53,364 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-02 11:50:53,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:53,365 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-02 11:50:53,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:50:53,380 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:50:53,380 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:53,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:53,396 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-02 11:50:53,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:53,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-02 11:50:53,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-02 11:50:53,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-02 11:50:53,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-02 11:50:53,422 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-10-02 11:50:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:53,917 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-02 11:50:53,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:50:53,917 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-10-02 11:50:53,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:53,918 INFO L225 Difference]: With dead ends: 31 [2018-10-02 11:50:53,918 INFO L226 Difference]: Without dead ends: 30 [2018-10-02 11:50:53,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-02 11:50:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-02 11:50:53,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-02 11:50:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-02 11:50:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-02 11:50:53,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-02 11:50:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:53,924 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-02 11:50:53,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-02 11:50:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-02 11:50:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 11:50:53,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:53,925 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-02 11:50:53,925 INFO L423 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:53,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:53,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-02 11:50:53,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:53,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:53,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:53,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:53,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:54,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:54,633 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-02 11:50:54,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:50:54,669 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-02 11:50:54,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:54,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:54,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:54,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-02 11:50:54,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-02 11:50:54,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-02 11:50:54,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-02 11:50:54,707 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-10-02 11:50:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:55,515 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-02 11:50:55,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 11:50:55,516 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-10-02 11:50:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:55,516 INFO L225 Difference]: With dead ends: 32 [2018-10-02 11:50:55,517 INFO L226 Difference]: Without dead ends: 31 [2018-10-02 11:50:55,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-02 11:50:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-02 11:50:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-02 11:50:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-02 11:50:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-02 11:50:55,522 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-02 11:50:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:55,522 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-02 11:50:55,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-02 11:50:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-02 11:50:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 11:50:55,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:55,523 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-02 11:50:55,523 INFO L423 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:55,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:55,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-02 11:50:55,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:55,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:55,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:55,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:55,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:56,139 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-02 11:50:56,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:56,140 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-02 11:50:56,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:50:56,158 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:50:56,158 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:56,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:56,171 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-02 11:50:56,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:56,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-02 11:50:56,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-02 11:50:56,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-02 11:50:56,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-02 11:50:56,202 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-10-02 11:50:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:56,790 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-02 11:50:56,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 11:50:56,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-10-02 11:50:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:56,791 INFO L225 Difference]: With dead ends: 33 [2018-10-02 11:50:56,791 INFO L226 Difference]: Without dead ends: 32 [2018-10-02 11:50:56,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-02 11:50:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-02 11:50:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-02 11:50:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-02 11:50:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-02 11:50:56,797 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-02 11:50:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:56,797 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-02 11:50:56,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-02 11:50:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-02 11:50:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-02 11:50:56,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:56,798 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-02 11:50:56,798 INFO L423 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:56,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:56,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-02 11:50:56,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:56,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:56,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:56,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:56,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:57,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:57,401 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 11:50:57,413 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:50:57,432 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-02 11:50:57,432 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:57,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:50:57,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:57,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-02 11:50:57,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-02 11:50:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-02 11:50:57,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-02 11:50:57,480 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-10-02 11:50:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:58,141 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-02 11:50:58,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:50:58,142 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-10-02 11:50:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:58,142 INFO L225 Difference]: With dead ends: 34 [2018-10-02 11:50:58,143 INFO L226 Difference]: Without dead ends: 33 [2018-10-02 11:50:58,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-02 11:50:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-02 11:50:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-02 11:50:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-02 11:50:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-02 11:50:58,148 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-02 11:50:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:58,148 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-02 11:50:58,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-02 11:50:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-02 11:50:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-02 11:50:58,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:58,149 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-02 11:50:58,149 INFO L423 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:58,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:58,150 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-02 11:50:58,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:58,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:58,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:58,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:58,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:50:58,784 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-02 11:50:58,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:50:58,784 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-02 11:50:58,794 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:50:58,809 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-02 11:50:58,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:50:58,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:50:58,841 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-02 11:50:58,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:50:58,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-02 11:50:58,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-02 11:50:58,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-02 11:50:58,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:50:58,868 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-10-02 11:50:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:50:59,694 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-02 11:50:59,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-02 11:50:59,694 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-10-02 11:50:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:50:59,695 INFO L225 Difference]: With dead ends: 35 [2018-10-02 11:50:59,695 INFO L226 Difference]: Without dead ends: 34 [2018-10-02 11:50:59,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:50:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-02 11:50:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-02 11:50:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-02 11:50:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-02 11:50:59,699 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-02 11:50:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:50:59,699 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-02 11:50:59,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-02 11:50:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-02 11:50:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 11:50:59,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:50:59,700 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-02 11:50:59,700 INFO L423 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:50:59,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:50:59,700 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-02 11:50:59,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:50:59,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:50:59,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:59,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:50:59,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:50:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:01,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:01,215 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-02 11:51:01,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:51:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:01,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:01,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:01,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-02 11:51:01,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-02 11:51:01,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-02 11:51:01,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:51:01,276 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-10-02 11:51:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:02,018 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-02 11:51:02,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 11:51:02,019 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-10-02 11:51:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:02,020 INFO L225 Difference]: With dead ends: 36 [2018-10-02 11:51:02,020 INFO L226 Difference]: Without dead ends: 35 [2018-10-02 11:51:02,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:51:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-02 11:51:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-02 11:51:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 11:51:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-02 11:51:02,025 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-02 11:51:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:02,025 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-02 11:51:02,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-02 11:51:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-02 11:51:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 11:51:02,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:02,026 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-02 11:51:02,026 INFO L423 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:02,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-02 11:51:02,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:02,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:02,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:02,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:51:02,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:02,730 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-02 11:51:02,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:02,730 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-02 11:51:02,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:51:02,748 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:51:02,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:02,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:02,811 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-02 11:51:02,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:02,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-02 11:51:02,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-02 11:51:02,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-02 11:51:02,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-02 11:51:02,845 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-10-02 11:51:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:03,669 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-02 11:51:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-02 11:51:03,670 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-10-02 11:51:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:03,670 INFO L225 Difference]: With dead ends: 37 [2018-10-02 11:51:03,671 INFO L226 Difference]: Without dead ends: 36 [2018-10-02 11:51:03,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-02 11:51:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-02 11:51:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-02 11:51:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-02 11:51:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-02 11:51:03,676 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-02 11:51:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:03,676 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-02 11:51:03,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-02 11:51:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-02 11:51:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-02 11:51:03,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:03,677 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-02 11:51:03,677 INFO L423 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:03,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-02 11:51:03,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:03,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:03,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:04,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:04,472 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-02 11:51:04,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:51:04,507 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-02 11:51:04,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:04,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:04,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:04,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-02 11:51:04,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-02 11:51:04,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-02 11:51:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-02 11:51:04,544 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-10-02 11:51:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:05,350 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-02 11:51:05,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-02 11:51:05,351 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-10-02 11:51:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:05,351 INFO L225 Difference]: With dead ends: 38 [2018-10-02 11:51:05,351 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 11:51:05,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-02 11:51:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 11:51:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-02 11:51:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-02 11:51:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-02 11:51:05,356 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-02 11:51:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:05,356 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-02 11:51:05,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-02 11:51:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-02 11:51:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 11:51:05,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:05,357 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-02 11:51:05,357 INFO L423 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:05,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-02 11:51:05,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:05,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:05,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:05,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:05,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:06,468 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-02 11:51:06,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:06,468 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-02 11:51:06,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:51:06,487 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:51:06,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:06,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:06,501 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-02 11:51:06,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:06,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-02 11:51:06,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-02 11:51:06,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-02 11:51:06,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:51:06,523 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-10-02 11:51:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:07,328 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-02 11:51:07,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-02 11:51:07,329 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-10-02 11:51:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:07,329 INFO L225 Difference]: With dead ends: 39 [2018-10-02 11:51:07,329 INFO L226 Difference]: Without dead ends: 38 [2018-10-02 11:51:07,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:51:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-02 11:51:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-02 11:51:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-02 11:51:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-02 11:51:07,334 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-02 11:51:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:07,334 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-02 11:51:07,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-02 11:51:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-02 11:51:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-02 11:51:07,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:07,335 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-02 11:51:07,335 INFO L423 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:07,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-02 11:51:07,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:07,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:07,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:08,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:08,156 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-02 11:51:08,163 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:51:08,183 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-02 11:51:08,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:08,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:08,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:08,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-02 11:51:08,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-02 11:51:08,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-02 11:51:08,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-02 11:51:08,219 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-10-02 11:51:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:09,068 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-02 11:51:09,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-02 11:51:09,068 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-10-02 11:51:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:09,069 INFO L225 Difference]: With dead ends: 40 [2018-10-02 11:51:09,069 INFO L226 Difference]: Without dead ends: 39 [2018-10-02 11:51:09,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-02 11:51:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-02 11:51:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-02 11:51:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-02 11:51:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-02 11:51:09,074 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-02 11:51:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:09,074 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-02 11:51:09,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-02 11:51:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-02 11:51:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-02 11:51:09,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:09,075 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-02 11:51:09,075 INFO L423 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:09,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:09,076 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-02 11:51:09,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:09,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:10,434 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-02 11:51:10,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:10,435 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-02 11:51:10,443 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:51:10,461 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-02 11:51:10,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:10,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:10,475 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-02 11:51:10,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:10,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-02 11:51:10,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-02 11:51:10,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-02 11:51:10,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-02 11:51:10,498 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-10-02 11:51:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:11,387 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-02 11:51:11,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 11:51:11,388 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-10-02 11:51:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:11,389 INFO L225 Difference]: With dead ends: 41 [2018-10-02 11:51:11,389 INFO L226 Difference]: Without dead ends: 40 [2018-10-02 11:51:11,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-02 11:51:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-02 11:51:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-02 11:51:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-02 11:51:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-02 11:51:11,394 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-02 11:51:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:11,394 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-02 11:51:11,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-02 11:51:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-02 11:51:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 11:51:11,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:11,395 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-02 11:51:11,395 INFO L423 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:11,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-02 11:51:11,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:11,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:11,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:11,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:11,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:12,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:12,746 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-02 11:51:12,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:51:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:12,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:12,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:12,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-02 11:51:12,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-02 11:51:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-02 11:51:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-02 11:51:12,796 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-10-02 11:51:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:13,727 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-02 11:51:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 11:51:13,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-10-02 11:51:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:13,728 INFO L225 Difference]: With dead ends: 42 [2018-10-02 11:51:13,728 INFO L226 Difference]: Without dead ends: 41 [2018-10-02 11:51:13,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-02 11:51:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-02 11:51:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-02 11:51:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-02 11:51:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-02 11:51:13,733 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-02 11:51:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:13,733 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-02 11:51:13,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-02 11:51:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-02 11:51:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-02 11:51:13,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:13,734 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-02 11:51:13,734 INFO L423 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:13,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-02 11:51:13,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:13,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:13,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:13,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:51:13,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:15,290 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-02 11:51:15,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:15,291 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-02 11:51:15,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:51:15,309 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:51:15,310 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:15,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:15,323 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-02 11:51:15,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:15,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-02 11:51:15,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-02 11:51:15,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-02 11:51:15,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-02 11:51:15,345 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-10-02 11:51:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:16,340 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-02 11:51:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-02 11:51:16,341 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-10-02 11:51:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:16,342 INFO L225 Difference]: With dead ends: 43 [2018-10-02 11:51:16,342 INFO L226 Difference]: Without dead ends: 42 [2018-10-02 11:51:16,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-02 11:51:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-02 11:51:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-02 11:51:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-02 11:51:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-02 11:51:16,346 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-02 11:51:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:16,347 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-02 11:51:16,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-02 11:51:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-02 11:51:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-02 11:51:16,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:16,347 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-02 11:51:16,348 INFO L423 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:16,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-02 11:51:16,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:16,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:16,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:16,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:16,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:17,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:17,329 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-02 11:51:17,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:51:17,358 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-02 11:51:17,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:17,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:17,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:17,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-02 11:51:17,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-02 11:51:17,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-02 11:51:17,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-02 11:51:17,390 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-10-02 11:51:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:18,404 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-02 11:51:18,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-02 11:51:18,405 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-10-02 11:51:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:18,406 INFO L225 Difference]: With dead ends: 44 [2018-10-02 11:51:18,406 INFO L226 Difference]: Without dead ends: 43 [2018-10-02 11:51:18,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-02 11:51:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-02 11:51:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-02 11:51:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-02 11:51:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-02 11:51:18,410 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-02 11:51:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:18,410 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-02 11:51:18,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-02 11:51:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-02 11:51:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-02 11:51:18,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:18,411 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-02 11:51:18,411 INFO L423 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:18,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-02 11:51:18,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:18,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:19,315 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-02 11:51:19,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:19,316 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-02 11:51:19,323 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:51:19,338 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:51:19,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:19,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:19,348 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-02 11:51:19,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:19,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-02 11:51:19,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-02 11:51:19,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-02 11:51:19,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-02 11:51:19,370 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-10-02 11:51:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:20,637 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-02 11:51:20,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 11:51:20,638 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-10-02 11:51:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:20,638 INFO L225 Difference]: With dead ends: 45 [2018-10-02 11:51:20,639 INFO L226 Difference]: Without dead ends: 44 [2018-10-02 11:51:20,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-02 11:51:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-02 11:51:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-02 11:51:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-02 11:51:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-02 11:51:20,644 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-02 11:51:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:20,644 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-02 11:51:20,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-02 11:51:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-02 11:51:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-02 11:51:20,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:20,645 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-02 11:51:20,645 INFO L423 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:20,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-02 11:51:20,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:20,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:20,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:20,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:20,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:22,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:22,957 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-02 11:51:22,966 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:51:22,988 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-02 11:51:22,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:22,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:23,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:23,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-02 11:51:23,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-02 11:51:23,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-02 11:51:23,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-02 11:51:23,026 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-10-02 11:51:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:24,153 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-02 11:51:24,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-02 11:51:24,154 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-10-02 11:51:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:24,154 INFO L225 Difference]: With dead ends: 46 [2018-10-02 11:51:24,155 INFO L226 Difference]: Without dead ends: 45 [2018-10-02 11:51:24,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-02 11:51:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-02 11:51:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-02 11:51:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-02 11:51:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-02 11:51:24,158 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-02 11:51:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:24,158 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-02 11:51:24,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-02 11:51:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-02 11:51:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-02 11:51:24,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:24,159 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-02 11:51:24,159 INFO L423 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:24,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:24,159 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-02 11:51:24,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:24,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:24,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:24,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:24,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:25,440 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-02 11:51:25,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:25,440 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:51:25,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:51:25,468 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-02 11:51:25,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:25,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:25,479 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-02 11:51:25,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:25,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-02 11:51:25,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-02 11:51:25,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-02 11:51:25,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-02 11:51:25,503 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-10-02 11:51:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:26,710 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-02 11:51:26,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-02 11:51:26,710 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-10-02 11:51:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:26,711 INFO L225 Difference]: With dead ends: 47 [2018-10-02 11:51:26,712 INFO L226 Difference]: Without dead ends: 46 [2018-10-02 11:51:26,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-02 11:51:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-02 11:51:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-02 11:51:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-02 11:51:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-02 11:51:26,716 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-02 11:51:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:26,717 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-02 11:51:26,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-02 11:51:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-02 11:51:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-02 11:51:26,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:26,717 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-02 11:51:26,718 INFO L423 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:26,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-02 11:51:26,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:26,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:26,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:28,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:28,163 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 11:51:28,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:51:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:28,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:28,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:28,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-02 11:51:28,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-02 11:51:28,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-02 11:51:28,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-02 11:51:28,218 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-10-02 11:51:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:29,462 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-02 11:51:29,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-02 11:51:29,463 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-10-02 11:51:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:29,464 INFO L225 Difference]: With dead ends: 48 [2018-10-02 11:51:29,464 INFO L226 Difference]: Without dead ends: 47 [2018-10-02 11:51:29,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-02 11:51:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-02 11:51:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-02 11:51:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-02 11:51:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-02 11:51:29,469 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-02 11:51:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:29,469 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-02 11:51:29,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-02 11:51:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-02 11:51:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 11:51:29,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:29,470 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-02 11:51:29,470 INFO L423 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:29,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:29,470 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-02 11:51:29,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:29,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:29,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:29,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:51:29,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:30,816 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-02 11:51:30,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:30,816 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-02 11:51:30,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:51:30,851 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:51:30,851 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:30,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:30,891 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-02 11:51:30,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:30,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-02 11:51:30,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-02 11:51:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-02 11:51:30,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-02 11:51:30,912 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-10-02 11:51:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:32,215 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-02 11:51:32,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 11:51:32,215 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-10-02 11:51:32,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:32,216 INFO L225 Difference]: With dead ends: 49 [2018-10-02 11:51:32,216 INFO L226 Difference]: Without dead ends: 48 [2018-10-02 11:51:32,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-02 11:51:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-02 11:51:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-02 11:51:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-02 11:51:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-02 11:51:32,220 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-10-02 11:51:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:32,220 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-02 11:51:32,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-02 11:51:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-02 11:51:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-02 11:51:32,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:32,221 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-10-02 11:51:32,221 INFO L423 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:32,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:32,222 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-10-02 11:51:32,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:32,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:32,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:32,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:32,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:33,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:33,351 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-02 11:51:33,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:51:33,385 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-02 11:51:33,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:33,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:33,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:33,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-02 11:51:33,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-02 11:51:33,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-02 11:51:33,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-02 11:51:33,451 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-10-02 11:51:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:34,816 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-02 11:51:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 11:51:34,817 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-10-02 11:51:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:34,817 INFO L225 Difference]: With dead ends: 50 [2018-10-02 11:51:34,818 INFO L226 Difference]: Without dead ends: 49 [2018-10-02 11:51:34,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-02 11:51:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-02 11:51:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-02 11:51:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-02 11:51:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-02 11:51:34,822 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-10-02 11:51:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:34,822 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-02 11:51:34,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-02 11:51:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-02 11:51:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-02 11:51:34,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:34,823 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-10-02 11:51:34,823 INFO L423 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:34,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-10-02 11:51:34,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:34,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:34,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:34,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:34,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:36,117 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-02 11:51:36,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:36,117 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-02 11:51:36,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:51:36,140 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:51:36,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:36,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:36,156 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-02 11:51:36,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:36,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-02 11:51:36,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-02 11:51:36,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-02 11:51:36,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-02 11:51:36,177 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-10-02 11:51:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:37,587 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-02 11:51:37,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 11:51:37,587 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-10-02 11:51:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:37,588 INFO L225 Difference]: With dead ends: 51 [2018-10-02 11:51:37,588 INFO L226 Difference]: Without dead ends: 50 [2018-10-02 11:51:37,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-02 11:51:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-02 11:51:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-02 11:51:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-02 11:51:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-02 11:51:37,593 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-10-02 11:51:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:37,593 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-02 11:51:37,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-02 11:51:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-02 11:51:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-02 11:51:37,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:37,594 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-10-02 11:51:37,594 INFO L423 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:37,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:37,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-10-02 11:51:37,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:37,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:37,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:37,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:37,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:38,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:38,822 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-02 11:51:38,830 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:51:38,851 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-02 11:51:38,851 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:38,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:38,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:38,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-02 11:51:38,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-02 11:51:38,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-02 11:51:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-02 11:51:38,902 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-10-02 11:51:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:40,596 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-02 11:51:40,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-02 11:51:40,596 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-10-02 11:51:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:40,597 INFO L225 Difference]: With dead ends: 52 [2018-10-02 11:51:40,597 INFO L226 Difference]: Without dead ends: 51 [2018-10-02 11:51:40,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-02 11:51:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-02 11:51:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-02 11:51:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-02 11:51:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-02 11:51:40,602 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-10-02 11:51:40,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:40,603 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-02 11:51:40,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-02 11:51:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-02 11:51:40,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-02 11:51:40,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:40,603 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-10-02 11:51:40,604 INFO L423 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:40,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:40,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-10-02 11:51:40,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:40,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:40,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:40,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:40,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:41,865 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-02 11:51:41,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:41,866 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-02 11:51:41,873 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:51:41,897 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-02 11:51:41,897 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:41,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:41,942 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-02 11:51:41,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:41,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-02 11:51:41,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-02 11:51:41,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-02 11:51:41,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-02 11:51:41,963 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-10-02 11:51:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:43,497 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-02 11:51:43,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-02 11:51:43,497 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-10-02 11:51:43,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:43,498 INFO L225 Difference]: With dead ends: 53 [2018-10-02 11:51:43,498 INFO L226 Difference]: Without dead ends: 52 [2018-10-02 11:51:43,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-02 11:51:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-02 11:51:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-02 11:51:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-02 11:51:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-02 11:51:43,503 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-10-02 11:51:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:43,503 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-02 11:51:43,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-02 11:51:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-02 11:51:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-02 11:51:43,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:43,504 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-10-02 11:51:43,504 INFO L423 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:43,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-10-02 11:51:43,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:43,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:43,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:43,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:43,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:44,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:44,855 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-02 11:51:44,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:51:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:44,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:44,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:44,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-02 11:51:44,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-02 11:51:44,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-02 11:51:44,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-02 11:51:44,917 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-10-02 11:51:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:46,692 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-02 11:51:46,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-02 11:51:46,693 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-10-02 11:51:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:46,693 INFO L225 Difference]: With dead ends: 54 [2018-10-02 11:51:46,694 INFO L226 Difference]: Without dead ends: 53 [2018-10-02 11:51:46,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-02 11:51:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-02 11:51:46,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-02 11:51:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-02 11:51:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-02 11:51:46,697 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-10-02 11:51:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:46,698 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-02 11:51:46,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-02 11:51:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-02 11:51:46,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 11:51:46,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:46,698 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-10-02 11:51:46,698 INFO L423 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:46,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:46,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-10-02 11:51:46,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:46,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:46,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:46,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:51:46,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:48,566 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-02 11:51:48,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:48,567 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-02 11:51:48,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:51:48,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:51:48,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:48,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:48,606 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-02 11:51:48,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:48,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-02 11:51:48,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-02 11:51:48,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-02 11:51:48,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-02 11:51:48,627 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-10-02 11:51:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:50,351 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-02 11:51:50,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-02 11:51:50,351 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-10-02 11:51:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:50,352 INFO L225 Difference]: With dead ends: 55 [2018-10-02 11:51:50,352 INFO L226 Difference]: Without dead ends: 54 [2018-10-02 11:51:50,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-02 11:51:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-02 11:51:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-02 11:51:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-02 11:51:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-02 11:51:50,357 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-10-02 11:51:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:50,357 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-02 11:51:50,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-02 11:51:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-02 11:51:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-02 11:51:50,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:50,358 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-10-02 11:51:50,358 INFO L423 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:50,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:50,358 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-10-02 11:51:50,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:50,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:50,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:50,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:50,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:51,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:51,925 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-02 11:51:51,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:51:51,959 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-02 11:51:51,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:51,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:51,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:51,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-02 11:51:51,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-02 11:51:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-02 11:51:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-02 11:51:51,995 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-10-02 11:51:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:53,754 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-02 11:51:53,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-02 11:51:53,755 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-10-02 11:51:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:53,755 INFO L225 Difference]: With dead ends: 56 [2018-10-02 11:51:53,756 INFO L226 Difference]: Without dead ends: 55 [2018-10-02 11:51:53,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-02 11:51:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-02 11:51:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-02 11:51:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-02 11:51:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-02 11:51:53,760 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-10-02 11:51:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:53,761 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-02 11:51:53,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-02 11:51:53,761 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-02 11:51:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-02 11:51:53,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:53,762 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-10-02 11:51:53,762 INFO L423 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:53,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-10-02 11:51:53,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:53,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:53,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:55,356 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-02 11:51:55,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:55,356 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-02 11:51:55,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:51:55,381 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:51:55,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:55,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:55,403 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-02 11:51:55,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:55,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-02 11:51:55,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-02 11:51:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-02 11:51:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-02 11:51:55,425 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-10-02 11:51:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:51:57,383 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-02 11:51:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 11:51:57,384 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-10-02 11:51:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:51:57,385 INFO L225 Difference]: With dead ends: 57 [2018-10-02 11:51:57,385 INFO L226 Difference]: Without dead ends: 56 [2018-10-02 11:51:57,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-02 11:51:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-02 11:51:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-02 11:51:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-02 11:51:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-02 11:51:57,390 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-10-02 11:51:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:51:57,390 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-02 11:51:57,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-02 11:51:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-02 11:51:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-02 11:51:57,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:51:57,391 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-10-02 11:51:57,391 INFO L423 AbstractCegarLoop]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:51:57,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:51:57,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-10-02 11:51:57,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:51:57,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:51:57,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:57,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:51:57,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:51:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:51:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:59,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:51:59,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 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-02 11:51:59,015 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:51:59,047 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-10-02 11:51:59,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:51:59,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:51:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:51:59,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:51:59,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-02 11:51:59,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-02 11:51:59,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-02 11:51:59,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-02 11:51:59,086 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-10-02 11:52:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:01,079 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-02 11:52:01,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 11:52:01,080 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-10-02 11:52:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:01,080 INFO L225 Difference]: With dead ends: 58 [2018-10-02 11:52:01,081 INFO L226 Difference]: Without dead ends: 57 [2018-10-02 11:52:01,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-02 11:52:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-02 11:52:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-02 11:52:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 11:52:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-02 11:52:01,085 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-10-02 11:52:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:01,086 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-02 11:52:01,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-02 11:52:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-02 11:52:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-02 11:52:01,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:01,086 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-10-02 11:52:01,087 INFO L423 AbstractCegarLoop]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:01,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-10-02 11:52:01,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:01,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:01,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:01,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:01,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:02,675 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-02 11:52:02,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:02,675 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-02 11:52:02,682 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:52:02,709 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-02 11:52:02,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:02,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:02,723 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-02 11:52:02,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:02,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-02 11:52:02,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-02 11:52:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-02 11:52:02,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-02 11:52:02,744 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-10-02 11:52:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:04,672 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-02 11:52:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-02 11:52:04,672 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-10-02 11:52:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:04,673 INFO L225 Difference]: With dead ends: 59 [2018-10-02 11:52:04,673 INFO L226 Difference]: Without dead ends: 58 [2018-10-02 11:52:04,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-02 11:52:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-02 11:52:04,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-02 11:52:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-02 11:52:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-02 11:52:04,678 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-10-02 11:52:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:04,678 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-02 11:52:04,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-02 11:52:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-02 11:52:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-02 11:52:04,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:04,678 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-10-02 11:52:04,679 INFO L423 AbstractCegarLoop]: === Iteration 56 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:04,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-10-02 11:52:04,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:04,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:04,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:07,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:07,148 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-02 11:52:07,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:52:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:07,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:07,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:07,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-02 11:52:07,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-02 11:52:07,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-02 11:52:07,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:52:07,207 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-10-02 11:52:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:09,217 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-02 11:52:09,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-02 11:52:09,217 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-10-02 11:52:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:09,218 INFO L225 Difference]: With dead ends: 60 [2018-10-02 11:52:09,218 INFO L226 Difference]: Without dead ends: 59 [2018-10-02 11:52:09,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:52:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-02 11:52:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-02 11:52:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-02 11:52:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-02 11:52:09,223 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-10-02 11:52:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:09,223 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-02 11:52:09,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-02 11:52:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-02 11:52:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-02 11:52:09,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:09,224 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-10-02 11:52:09,224 INFO L423 AbstractCegarLoop]: === Iteration 57 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:09,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:09,224 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-10-02 11:52:09,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:09,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:09,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:52:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:11,212 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-02 11:52:11,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:11,213 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-02 11:52:11,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:52:11,241 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:52:11,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:11,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:11,258 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-02 11:52:11,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:11,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-02 11:52:11,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-02 11:52:11,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-02 11:52:11,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-02 11:52:11,282 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-10-02 11:52:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:13,402 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-02 11:52:13,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-02 11:52:13,402 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-10-02 11:52:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:13,403 INFO L225 Difference]: With dead ends: 61 [2018-10-02 11:52:13,404 INFO L226 Difference]: Without dead ends: 60 [2018-10-02 11:52:13,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-02 11:52:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-02 11:52:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-10-02 11:52:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-02 11:52:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-02 11:52:13,408 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-10-02 11:52:13,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:13,409 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-02 11:52:13,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-02 11:52:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-02 11:52:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-02 11:52:13,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:13,409 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-10-02 11:52:13,410 INFO L423 AbstractCegarLoop]: === Iteration 58 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:13,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-10-02 11:52:13,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:13,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:13,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:13,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:13,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:15,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:15,104 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-02 11:52:15,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:52:15,149 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-10-02 11:52:15,149 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:15,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:15,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:15,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-02 11:52:15,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-02 11:52:15,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-02 11:52:15,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-02 11:52:15,187 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-10-02 11:52:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:17,523 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-02 11:52:17,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-02 11:52:17,523 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-10-02 11:52:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:17,524 INFO L225 Difference]: With dead ends: 62 [2018-10-02 11:52:17,524 INFO L226 Difference]: Without dead ends: 61 [2018-10-02 11:52:17,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-02 11:52:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-02 11:52:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-02 11:52:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-02 11:52:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-02 11:52:17,529 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-10-02 11:52:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:17,530 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-02 11:52:17,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-02 11:52:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-02 11:52:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-02 11:52:17,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:17,530 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-10-02 11:52:17,531 INFO L423 AbstractCegarLoop]: === Iteration 59 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:17,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:17,531 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-10-02 11:52:17,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:17,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:17,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:17,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:17,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:19,411 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-02 11:52:19,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:19,412 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-02 11:52:19,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:52:19,440 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:52:19,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:19,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:19,458 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-02 11:52:19,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:19,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-02 11:52:19,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-02 11:52:19,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-02 11:52:19,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-02 11:52:19,481 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-10-02 11:52:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:21,874 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-02 11:52:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-02 11:52:21,875 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-10-02 11:52:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:21,876 INFO L225 Difference]: With dead ends: 63 [2018-10-02 11:52:21,876 INFO L226 Difference]: Without dead ends: 62 [2018-10-02 11:52:21,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-02 11:52:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-02 11:52:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-10-02 11:52:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-02 11:52:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-02 11:52:21,880 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-10-02 11:52:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:21,880 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-02 11:52:21,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-02 11:52:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-02 11:52:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-02 11:52:21,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:21,881 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-10-02 11:52:21,881 INFO L423 AbstractCegarLoop]: === Iteration 60 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:21,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-10-02 11:52:21,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:21,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:21,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:21,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:21,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:23,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:23,745 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-02 11:52:23,753 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:52:23,784 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-02 11:52:23,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:23,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:23,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:23,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-02 11:52:23,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-02 11:52:23,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-02 11:52:23,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-02 11:52:23,823 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-10-02 11:52:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:26,148 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-02 11:52:26,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-02 11:52:26,148 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-10-02 11:52:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:26,149 INFO L225 Difference]: With dead ends: 64 [2018-10-02 11:52:26,149 INFO L226 Difference]: Without dead ends: 63 [2018-10-02 11:52:26,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-02 11:52:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-02 11:52:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-02 11:52:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-02 11:52:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-02 11:52:26,152 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-10-02 11:52:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:26,152 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-02 11:52:26,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-02 11:52:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-02 11:52:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-02 11:52:26,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:26,153 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-10-02 11:52:26,153 INFO L423 AbstractCegarLoop]: === Iteration 61 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:26,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-10-02 11:52:26,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:26,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:26,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:28,309 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-02 11:52:28,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:28,310 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-02 11:52:28,318 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:52:28,350 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-02 11:52:28,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:28,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:28,370 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-02 11:52:28,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:28,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-02 11:52:28,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-02 11:52:28,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-02 11:52:28,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-02 11:52:28,402 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-10-02 11:52:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:31,235 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-02 11:52:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-02 11:52:31,235 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-10-02 11:52:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:31,236 INFO L225 Difference]: With dead ends: 65 [2018-10-02 11:52:31,236 INFO L226 Difference]: Without dead ends: 64 [2018-10-02 11:52:31,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-02 11:52:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-02 11:52:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-10-02 11:52:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-02 11:52:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-02 11:52:31,239 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-10-02 11:52:31,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:31,239 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-02 11:52:31,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-02 11:52:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-02 11:52:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-02 11:52:31,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:31,240 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-10-02 11:52:31,240 INFO L423 AbstractCegarLoop]: === Iteration 62 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:31,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:31,240 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-10-02 11:52:31,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:31,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:31,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:31,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:31,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:33,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:33,326 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-02 11:52:33,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:52:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:33,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:33,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:33,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-02 11:52:33,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-02 11:52:33,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-02 11:52:33,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-02 11:52:33,389 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-10-02 11:52:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:35,846 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-02 11:52:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-02 11:52:35,846 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-10-02 11:52:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:35,847 INFO L225 Difference]: With dead ends: 66 [2018-10-02 11:52:35,847 INFO L226 Difference]: Without dead ends: 65 [2018-10-02 11:52:35,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-02 11:52:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-02 11:52:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-02 11:52:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-02 11:52:35,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-02 11:52:35,852 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-10-02 11:52:35,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:35,852 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-02 11:52:35,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-02 11:52:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-02 11:52:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-02 11:52:35,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:35,853 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-10-02 11:52:35,853 INFO L423 AbstractCegarLoop]: === Iteration 63 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:35,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:35,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-10-02 11:52:35,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:35,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:35,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:35,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:52:35,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:38,050 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-02 11:52:38,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:38,050 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-02 11:52:38,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:52:38,087 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:52:38,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:38,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:38,102 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-02 11:52:38,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:38,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-02 11:52:38,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-02 11:52:38,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-02 11:52:38,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-02 11:52:38,132 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-10-02 11:52:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:40,716 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-02 11:52:40,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-02 11:52:40,716 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-10-02 11:52:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:40,717 INFO L225 Difference]: With dead ends: 67 [2018-10-02 11:52:40,717 INFO L226 Difference]: Without dead ends: 66 [2018-10-02 11:52:40,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-02 11:52:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-02 11:52:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-02 11:52:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-02 11:52:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-02 11:52:40,722 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-10-02 11:52:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:40,723 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-02 11:52:40,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-02 11:52:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-02 11:52:40,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-02 11:52:40,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:40,723 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-10-02 11:52:40,724 INFO L423 AbstractCegarLoop]: === Iteration 64 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:40,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:40,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-10-02 11:52:40,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:40,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:40,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:40,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:40,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:43,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:43,315 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-02 11:52:43,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:52:43,376 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-10-02 11:52:43,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:43,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:43,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:43,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-02 11:52:43,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-02 11:52:43,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-02 11:52:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-02 11:52:43,430 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-10-02 11:52:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:46,353 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-02 11:52:46,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-02 11:52:46,353 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-10-02 11:52:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:46,354 INFO L225 Difference]: With dead ends: 68 [2018-10-02 11:52:46,354 INFO L226 Difference]: Without dead ends: 67 [2018-10-02 11:52:46,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-02 11:52:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-02 11:52:46,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-02 11:52:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-02 11:52:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-02 11:52:46,361 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-10-02 11:52:46,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:46,361 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-02 11:52:46,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-02 11:52:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-02 11:52:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 11:52:46,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:46,362 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-10-02 11:52:46,362 INFO L423 AbstractCegarLoop]: === Iteration 65 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:46,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:46,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-10-02 11:52:46,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:46,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:46,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:46,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:46,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:48,864 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-02 11:52:48,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:48,864 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-02 11:52:48,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:52:48,893 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:52:48,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:48,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:48,911 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-02 11:52:48,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:48,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-02 11:52:48,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-02 11:52:48,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-02 11:52:48,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-02 11:52:48,943 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-10-02 11:52:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:51,689 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-02 11:52:51,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-02 11:52:51,689 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-10-02 11:52:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:51,690 INFO L225 Difference]: With dead ends: 69 [2018-10-02 11:52:51,690 INFO L226 Difference]: Without dead ends: 68 [2018-10-02 11:52:51,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-02 11:52:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-02 11:52:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-02 11:52:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-02 11:52:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-02 11:52:51,695 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-10-02 11:52:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:51,695 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-02 11:52:51,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-02 11:52:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-02 11:52:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-02 11:52:51,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:51,696 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-10-02 11:52:51,696 INFO L423 AbstractCegarLoop]: === Iteration 66 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:51,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:51,696 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-10-02 11:52:51,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:51,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:51,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:51,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:51,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:54,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:54,084 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-02 11:52:54,092 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:52:54,127 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-10-02 11:52:54,127 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:54,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:52:54,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:54,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-02 11:52:54,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-02 11:52:54,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-02 11:52:54,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-02 11:52:54,174 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-10-02 11:52:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:52:57,048 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-02 11:52:57,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-02 11:52:57,048 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-10-02 11:52:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:52:57,049 INFO L225 Difference]: With dead ends: 70 [2018-10-02 11:52:57,049 INFO L226 Difference]: Without dead ends: 69 [2018-10-02 11:52:57,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-02 11:52:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-02 11:52:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-02 11:52:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-02 11:52:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-02 11:52:57,054 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-10-02 11:52:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:52:57,054 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-02 11:52:57,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-02 11:52:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-02 11:52:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-02 11:52:57,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:52:57,055 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-10-02 11:52:57,055 INFO L423 AbstractCegarLoop]: === Iteration 67 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:52:57,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:52:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-10-02 11:52:57,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:52:57,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:52:57,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:57,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:52:57,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:52:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:52:59,438 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-02 11:52:59,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:52:59,438 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-02 11:52:59,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:52:59,480 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-10-02 11:52:59,480 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:52:59,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:52:59,499 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-02 11:52:59,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:52:59,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-02 11:52:59,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-02 11:52:59,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-02 11:52:59,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-02 11:52:59,521 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-10-02 11:53:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:53:02,626 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-02 11:53:02,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-02 11:53:02,627 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-10-02 11:53:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:53:02,628 INFO L225 Difference]: With dead ends: 71 [2018-10-02 11:53:02,628 INFO L226 Difference]: Without dead ends: 70 [2018-10-02 11:53:02,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-02 11:53:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-02 11:53:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-02 11:53:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-02 11:53:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-02 11:53:02,633 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-10-02 11:53:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:53:02,633 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-02 11:53:02,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-02 11:53:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-02 11:53:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-02 11:53:02,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:53:02,634 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-10-02 11:53:02,634 INFO L423 AbstractCegarLoop]: === Iteration 68 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:53:02,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:53:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-10-02 11:53:02,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:53:02,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:53:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:02,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:53:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:53:04,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:53:04,884 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-02 11:53:04,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:53:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:04,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:53:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:53:04,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:53:04,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-02 11:53:04,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-02 11:53:04,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-02 11:53:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-02 11:53:04,948 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-10-02 11:53:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:53:08,013 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-02 11:53:08,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-02 11:53:08,013 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-10-02 11:53:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:53:08,014 INFO L225 Difference]: With dead ends: 72 [2018-10-02 11:53:08,014 INFO L226 Difference]: Without dead ends: 71 [2018-10-02 11:53:08,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-02 11:53:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-02 11:53:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-02 11:53:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-02 11:53:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-02 11:53:08,019 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-10-02 11:53:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:53:08,019 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-02 11:53:08,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-02 11:53:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-02 11:53:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-02 11:53:08,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:53:08,019 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-10-02 11:53:08,020 INFO L423 AbstractCegarLoop]: === Iteration 69 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:53:08,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:53:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-10-02 11:53:08,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:53:08,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:53:08,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:08,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:53:08,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:10,323 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-02 11:53:10,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:53:10,323 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-02 11:53:10,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:53:10,354 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:53:10,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:53:10,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:53:10,372 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-02 11:53:10,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:53:10,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-02 11:53:10,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-02 11:53:10,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-02 11:53:10,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-02 11:53:10,394 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-10-02 11:53:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:53:13,576 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-02 11:53:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-02 11:53:13,577 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-10-02 11:53:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:53:13,577 INFO L225 Difference]: With dead ends: 73 [2018-10-02 11:53:13,578 INFO L226 Difference]: Without dead ends: 72 [2018-10-02 11:53:13,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-02 11:53:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-02 11:53:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-10-02 11:53:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-02 11:53:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-02 11:53:13,582 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-10-02 11:53:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:53:13,582 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-02 11:53:13,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-02 11:53:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-02 11:53:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-02 11:53:13,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:53:13,583 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-10-02 11:53:13,584 INFO L423 AbstractCegarLoop]: === Iteration 70 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:53:13,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:53:13,585 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-10-02 11:53:13,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:53:13,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:53:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:13,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:53:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:53:16,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:53:16,005 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-02 11:53:16,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:53:16,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-02 11:53:16,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:53:16,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:53:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:53:16,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:53:16,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-02 11:53:16,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-02 11:53:16,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-02 11:53:16,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-02 11:53:16,096 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-10-02 11:53:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:53:19,422 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-02 11:53:19,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-02 11:53:19,423 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-10-02 11:53:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:53:19,423 INFO L225 Difference]: With dead ends: 74 [2018-10-02 11:53:19,424 INFO L226 Difference]: Without dead ends: 73 [2018-10-02 11:53:19,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-02 11:53:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-02 11:53:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-02 11:53:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-02 11:53:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-02 11:53:19,429 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-10-02 11:53:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:53:19,429 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-02 11:53:19,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-02 11:53:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-02 11:53:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-02 11:53:19,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:53:19,430 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-10-02 11:53:19,430 INFO L423 AbstractCegarLoop]: === Iteration 71 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:53:19,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:53:19,431 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-10-02 11:53:19,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:53:19,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:53:19,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:19,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:53:19,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:21,828 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-02 11:53:21,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:53:21,829 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 11:53:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:53:21,863 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:53:21,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:53:21,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:53:21,882 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-02 11:53:21,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:53:21,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-02 11:53:21,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-02 11:53:21,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-02 11:53:21,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-02 11:53:21,904 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-10-02 11:53:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:53:25,591 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-02 11:53:25,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-02 11:53:25,592 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-10-02 11:53:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:53:25,593 INFO L225 Difference]: With dead ends: 75 [2018-10-02 11:53:25,593 INFO L226 Difference]: Without dead ends: 74 [2018-10-02 11:53:25,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-02 11:53:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-02 11:53:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-02 11:53:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-02 11:53:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-02 11:53:25,599 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-10-02 11:53:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:53:25,599 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-02 11:53:25,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-02 11:53:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-02 11:53:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-02 11:53:25,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:53:25,600 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-10-02 11:53:25,600 INFO L423 AbstractCegarLoop]: === Iteration 72 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:53:25,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:53:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-10-02 11:53:25,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:53:25,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:53:25,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:25,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:53:25,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:53:28,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:53:28,544 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-02 11:53:28,551 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:53:28,682 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-02 11:53:28,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:53:28,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:53:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:53:28,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:53:28,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-02 11:53:28,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-02 11:53:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-02 11:53:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-02 11:53:28,745 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-10-02 11:53:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:53:32,628 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-02 11:53:32,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-02 11:53:32,629 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-10-02 11:53:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:53:32,630 INFO L225 Difference]: With dead ends: 76 [2018-10-02 11:53:32,630 INFO L226 Difference]: Without dead ends: 75 [2018-10-02 11:53:32,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-02 11:53:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-02 11:53:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-02 11:53:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-02 11:53:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-02 11:53:32,635 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-10-02 11:53:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:53:32,636 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-02 11:53:32,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-02 11:53:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-02 11:53:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-02 11:53:32,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:53:32,636 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-10-02 11:53:32,637 INFO L423 AbstractCegarLoop]: === Iteration 73 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:53:32,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:53:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-10-02 11:53:32,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:53:32,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:53:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:32,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:53:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:36,238 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-02 11:53:36,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:53:36,238 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-02 11:53:36,245 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:53:36,706 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-02 11:53:36,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:53:36,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:53:36,762 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-02 11:53:36,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:53:36,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-02 11:53:36,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-02 11:53:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-02 11:53:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-02 11:53:36,796 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-10-02 11:53:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:53:40,388 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-02 11:53:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-02 11:53:40,389 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-10-02 11:53:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:53:40,390 INFO L225 Difference]: With dead ends: 77 [2018-10-02 11:53:40,390 INFO L226 Difference]: Without dead ends: 76 [2018-10-02 11:53:40,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-02 11:53:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-02 11:53:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-02 11:53:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-02 11:53:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-02 11:53:40,397 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-10-02 11:53:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:53:40,397 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-02 11:53:40,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-02 11:53:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-02 11:53:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-02 11:53:40,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:53:40,398 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-10-02 11:53:40,398 INFO L423 AbstractCegarLoop]: === Iteration 74 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:53:40,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:53:40,398 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-10-02 11:53:40,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:53:40,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:53:40,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:40,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:53:40,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:53:43,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:53:43,892 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-02 11:53:43,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:53:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:43,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:53:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:53:43,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:53:43,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-02 11:53:43,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-02 11:53:43,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-02 11:53:43,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-02 11:53:43,980 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-10-02 11:53:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:53:47,530 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-02 11:53:47,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-02 11:53:47,531 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-10-02 11:53:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:53:47,532 INFO L225 Difference]: With dead ends: 78 [2018-10-02 11:53:47,532 INFO L226 Difference]: Without dead ends: 77 [2018-10-02 11:53:47,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-02 11:53:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-02 11:53:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-02 11:53:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-02 11:53:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-02 11:53:47,538 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-10-02 11:53:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:53:47,538 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-02 11:53:47,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-02 11:53:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-02 11:53:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-02 11:53:47,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:53:47,539 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-10-02 11:53:47,540 INFO L423 AbstractCegarLoop]: === Iteration 75 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:53:47,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:53:47,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-10-02 11:53:47,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:53:47,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:53:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:47,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:53:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:52,208 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-02 11:53:52,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:53:52,209 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-02 11:53:52,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:53:52,238 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:53:52,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:53:52,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:53:52,261 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-02 11:53:52,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:53:52,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-02 11:53:52,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-02 11:53:52,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-02 11:53:52,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-02 11:53:52,282 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-10-02 11:53:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:53:55,932 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-02 11:53:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-02 11:53:55,933 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-10-02 11:53:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:53:55,934 INFO L225 Difference]: With dead ends: 79 [2018-10-02 11:53:55,934 INFO L226 Difference]: Without dead ends: 78 [2018-10-02 11:53:55,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-02 11:53:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-02 11:53:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-02 11:53:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-02 11:53:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-02 11:53:55,938 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-10-02 11:53:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:53:55,939 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-02 11:53:55,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-02 11:53:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-02 11:53:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-02 11:53:55,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:53:55,939 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-10-02 11:53:55,939 INFO L423 AbstractCegarLoop]: === Iteration 76 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:53:55,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:53:55,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-10-02 11:53:55,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:53:55,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:53:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:55,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:53:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:53:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:53:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:53:58,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:53:58,962 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-02 11:53:58,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:53:59,011 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-10-02 11:53:59,011 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:53:59,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:53:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:53:59,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:53:59,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-02 11:53:59,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-02 11:53:59,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-02 11:53:59,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-02 11:53:59,059 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-10-02 11:54:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:02,714 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-02 11:54:02,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-02 11:54:02,714 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-10-02 11:54:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:02,715 INFO L225 Difference]: With dead ends: 80 [2018-10-02 11:54:02,715 INFO L226 Difference]: Without dead ends: 79 [2018-10-02 11:54:02,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-02 11:54:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-02 11:54:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-02 11:54:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-02 11:54:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-02 11:54:02,720 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-10-02 11:54:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:02,720 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-02 11:54:02,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-02 11:54:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-02 11:54:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-02 11:54:02,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:02,720 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-10-02 11:54:02,721 INFO L423 AbstractCegarLoop]: === Iteration 77 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:02,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:02,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-10-02 11:54:02,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:02,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:02,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:02,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:54:02,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:06,338 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-02 11:54:06,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:06,338 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 11:54:06,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:54:06,370 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:54:06,371 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:54:06,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:06,390 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-02 11:54:06,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:06,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-02 11:54:06,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-02 11:54:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-02 11:54:06,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-02 11:54:06,413 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-10-02 11:54:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:10,331 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-02 11:54:10,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-02 11:54:10,332 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-10-02 11:54:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:10,333 INFO L225 Difference]: With dead ends: 81 [2018-10-02 11:54:10,333 INFO L226 Difference]: Without dead ends: 80 [2018-10-02 11:54:10,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-02 11:54:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-02 11:54:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-02 11:54:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-02 11:54:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-02 11:54:10,336 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-10-02 11:54:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:10,337 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-02 11:54:10,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-02 11:54:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-02 11:54:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-02 11:54:10,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:10,337 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-10-02 11:54:10,338 INFO L423 AbstractCegarLoop]: === Iteration 78 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:10,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-10-02 11:54:10,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:10,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:10,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:54:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:13,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:13,159 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-02 11:54:13,166 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:54:13,208 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-10-02 11:54:13,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:54:13,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:13,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:13,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-02 11:54:13,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-02 11:54:13,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-02 11:54:13,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-02 11:54:13,318 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-10-02 11:54:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:17,367 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-02 11:54:17,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-02 11:54:17,368 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-10-02 11:54:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:17,369 INFO L225 Difference]: With dead ends: 82 [2018-10-02 11:54:17,369 INFO L226 Difference]: Without dead ends: 81 [2018-10-02 11:54:17,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-02 11:54:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-02 11:54:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-02 11:54:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-02 11:54:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-02 11:54:17,375 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-10-02 11:54:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:17,375 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-02 11:54:17,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-02 11:54:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-02 11:54:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-02 11:54:17,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:17,376 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-10-02 11:54:17,376 INFO L423 AbstractCegarLoop]: === Iteration 79 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:17,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:17,376 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-10-02 11:54:17,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:17,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:17,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:17,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:54:17,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:20,756 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-02 11:54:20,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:20,757 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 11:54:20,763 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:54:20,854 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2018-10-02 11:54:20,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:54:20,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:20,875 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-02 11:54:20,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:20,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-02 11:54:20,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-02 11:54:20,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-02 11:54:20,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-02 11:54:20,896 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-10-02 11:54:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:25,005 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-02 11:54:25,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-02 11:54:25,006 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-10-02 11:54:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:25,007 INFO L225 Difference]: With dead ends: 83 [2018-10-02 11:54:25,007 INFO L226 Difference]: Without dead ends: 82 [2018-10-02 11:54:25,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-02 11:54:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-02 11:54:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-02 11:54:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-02 11:54:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-02 11:54:25,012 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-10-02 11:54:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:25,013 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-02 11:54:25,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-02 11:54:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-02 11:54:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-02 11:54:25,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:25,014 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-10-02 11:54:25,014 INFO L423 AbstractCegarLoop]: === Iteration 80 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:25,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-10-02 11:54:25,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:25,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:25,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:25,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:54:25,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:28,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:28,132 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-02 11:54:28,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:54:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:28,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:54:28,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:28,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-02 11:54:28,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-02 11:54:28,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-02 11:54:28,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-02 11:54:28,273 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-10-02 11:54:32,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:54:32,557 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-02 11:54:32,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-02 11:54:32,557 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-10-02 11:54:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:54:32,558 INFO L225 Difference]: With dead ends: 84 [2018-10-02 11:54:32,558 INFO L226 Difference]: Without dead ends: 83 [2018-10-02 11:54:32,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-02 11:54:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-02 11:54:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-02 11:54:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-02 11:54:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-02 11:54:32,563 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-10-02 11:54:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:54:32,563 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-02 11:54:32,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-02 11:54:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-02 11:54:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-02 11:54:32,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:54:32,564 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-10-02 11:54:32,564 INFO L423 AbstractCegarLoop]: === Iteration 81 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:54:32,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:54:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-10-02 11:54:32,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:54:32,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:54:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:32,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:54:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:54:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:54:35,989 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-02 11:54:35,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:54:35,989 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-02 11:54:35,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:54:36,024 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:54:36,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:54:36,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:54:36,053 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-02 11:54:36,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:54:36,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-02 11:54:36,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-02 11:54:36,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-02 11:54:36,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-02 11:54:36,074 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. Received shutdown request... [2018-10-02 11:54:37,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:54:37,421 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 11:54:37,428 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 11:54:37,428 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:54:37 BoogieIcfgContainer [2018-10-02 11:54:37,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:54:37,429 INFO L168 Benchmark]: Toolchain (without parser) took 242558.22 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -95.4 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 191.8 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2018-10-02 11:54:37,430 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-02 11:54:37,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.74 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-02 11:54:37,431 INFO L168 Benchmark]: Boogie Preprocessor took 22.39 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-02 11:54:37,431 INFO L168 Benchmark]: RCFGBuilder took 281.87 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-02 11:54:37,432 INFO L168 Benchmark]: TraceAbstraction took 242203.10 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -95.4 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 170.7 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. [2018-10-02 11:54:37,434 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.19 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 44.74 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 22.39 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 281.87 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 242203.10 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -95.4 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 170.7 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (83states) and FLOYD_HOARE automaton (currently 29 states, 83 states before enhancement), while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 242.1s OverallTime, 81 OverallIterations, 80 TraceHistogramMax, 121.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 162 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 182548 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6641 GetRequests, 3240 SyntacticMatches, 80 SemanticMatches, 3321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 110.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 80 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 113.7s InterpolantComputationTime, 6802 NumberOfCodeBlocks, 6802 NumberOfCodeBlocksAsserted, 981 NumberOfCheckSat, 6641 ConstructedInterpolants, 0 QuantifiedInterpolants, 2526167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6880 ConjunctsInSsa, 6720 ConjunctsInUnsatCore, 161 InterpolantComputations, 1 PerfectInterpolantSequences, 0/177120 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-54-37-443.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-54-37-443.csv Completed graceful shutdown