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_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:17:50,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:17:50,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:17:50,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:17:50,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:17:50,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:17:50,695 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:17:50,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:17:50,698 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:17:50,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:17:50,700 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:17:50,701 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:17:50,701 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:17:50,702 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:17:50,703 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:17:50,704 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:17:50,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:17:50,707 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:17:50,709 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:17:50,710 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:17:50,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:17:50,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:17:50,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:17:50,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:17:50,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:17:50,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:17:50,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:17:50,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:17:50,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:17:50,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:17:50,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:17:50,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:17:50,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:17:50,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:17:50,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:17:50,722 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:17:50,723 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-02 12:17:50,746 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:17:50,746 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:17:50,747 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:17:50,747 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:17:50,748 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:17:50,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:17:50,749 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:17:50,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:17:50,749 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:17:50,749 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:17:50,750 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:17:50,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:17:50,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:17:50,750 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:17:50,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:17:50,752 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:17:50,752 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:17:50,752 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:17:50,752 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:17:50,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:17:50,753 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:17:50,753 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:17:50,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:17:50,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:17:50,755 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:17:50,755 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:17:50,755 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:17:50,755 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:17:50,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:17:50,756 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:17:50,756 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:17:50,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:17:50,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:17:50,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:17:50,831 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:17:50,831 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:17:50,832 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 12:17:50,832 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl' [2018-10-02 12:17:50,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:17:50,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:17:50,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:17:50,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:17:50,878 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:17:50,899 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 12:17:50" (1/1) ... [2018-10-02 12:17:50,912 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 12:17:50" (1/1) ... [2018-10-02 12:17:50,917 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 12:17:50,917 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 12:17:50,917 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 12:17:50,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:17:50,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:17:50,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:17:50,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:17:50,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 12:17:50" (1/1) ... [2018-10-02 12:17:50,933 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 12:17:50" (1/1) ... [2018-10-02 12:17:50,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 12:17:50" (1/1) ... [2018-10-02 12:17:50,934 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 12:17:50" (1/1) ... [2018-10-02 12:17:50,937 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 12:17:50" (1/1) ... [2018-10-02 12:17:50,940 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 12:17:50" (1/1) ... [2018-10-02 12:17:50,941 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 12:17:50" (1/1) ... [2018-10-02 12:17:50,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:17:50,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:17:50,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:17:50,944 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:17:50,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:17:50" (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 12:17:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-10-02 12:17:51,018 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-10-02 12:17:51,204 INFO L337 CfgBuilder]: Using library mode [2018-10-02 12:17:51,205 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:17:51 BoogieIcfgContainer [2018-10-02 12:17:51,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:17:51,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:17:51,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:17:51,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:17:51,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:17:50" (1/2) ... [2018-10-02 12:17:51,212 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 12:17:51, skipping insertion in model container [2018-10-02 12:17:51,213 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 12:17:51" (2/2) ... [2018-10-02 12:17:51,215 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-10-02 12:17:51,226 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:17:51,237 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:17:51,292 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:17:51,293 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:17:51,293 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:17:51,293 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:17:51,293 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:17:51,294 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:17:51,294 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:17:51,294 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:17:51,294 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:17:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-02 12:17:51,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-02 12:17:51,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:51,321 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-02 12:17:51,323 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:51,332 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:51,332 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-02 12:17:51,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:51,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:51,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:51,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:51,518 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 12:17:51,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:17:51,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-02 12:17:51,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:17:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:17:51,538 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:51,540 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-02 12:17:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:51,753 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-02 12:17:51,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:17:51,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-02 12:17:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:51,766 INFO L225 Difference]: With dead ends: 9 [2018-10-02 12:17:51,767 INFO L226 Difference]: Without dead ends: 4 [2018-10-02 12:17:51,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-02 12:17:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-02 12:17:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-02 12:17:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-02 12:17:51,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-02 12:17:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:51,808 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-02 12:17:51,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:17:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-02 12:17:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-02 12:17:51,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:51,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-02 12:17:51,810 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:51,810 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:51,812 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-02 12:17:51,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:51,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:51,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:51,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:51,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:51,901 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 12:17:51,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:51,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 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 12:17:51,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:51,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:51,947 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 12:17:51,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:51,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-10-02 12:17:51,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:17:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:17:51,970 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:51,971 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-10-02 12:17:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:52,091 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-02 12:17:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:17:52,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-10-02 12:17:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:52,092 INFO L225 Difference]: With dead ends: 6 [2018-10-02 12:17:52,092 INFO L226 Difference]: Without dead ends: 5 [2018-10-02 12:17:52,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-02 12:17:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-02 12:17:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-02 12:17:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-02 12:17:52,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-02 12:17:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:52,095 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-02 12:17:52,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:17:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-02 12:17:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-02 12:17:52,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:52,096 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-02 12:17:52,097 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:52,097 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:52,097 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-02 12:17:52,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:52,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:52,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:52,165 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 12:17:52,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:52,165 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 12:17:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:17:52,209 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:17:52,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:52,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:52,234 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 12:17:52,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:52,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-02 12:17:52,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:17:52,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:17:52,254 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:52,254 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-10-02 12:17:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:52,641 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-02 12:17:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:17:52,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-02 12:17:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:52,643 INFO L225 Difference]: With dead ends: 7 [2018-10-02 12:17:52,643 INFO L226 Difference]: Without dead ends: 6 [2018-10-02 12:17:52,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-02 12:17:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-02 12:17:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-02 12:17:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-02 12:17:52,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-02 12:17:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:52,646 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-02 12:17:52,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:17:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-02 12:17:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 12:17:52,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:52,647 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-02 12:17:52,648 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:52,648 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:52,648 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-02 12:17:52,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:52,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:52,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:52,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:17:52,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:52,759 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 12:17:52,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:52,760 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 12:17:52,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:17:52,774 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-02 12:17:52,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:52,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:52,806 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 12:17:52,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:52,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 12:17:52,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 12:17:52,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 12:17:52,827 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:52,827 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-10-02 12:17:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:53,098 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-02 12:17:53,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 12:17:53,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-02 12:17:53,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:53,100 INFO L225 Difference]: With dead ends: 8 [2018-10-02 12:17:53,100 INFO L226 Difference]: Without dead ends: 7 [2018-10-02 12:17:53,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:17:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-02 12:17:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-02 12:17:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-02 12:17:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-02 12:17:53,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-02 12:17:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:53,105 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-02 12:17:53,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 12:17:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-02 12:17:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 12:17:53,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:53,106 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-02 12:17:53,106 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:53,106 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:53,107 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-02 12:17:53,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:53,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:53,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:17:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:53,183 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 12:17:53,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:53,183 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 12:17:53,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:17:53,197 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:17:53,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:53,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:53,245 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 12:17:53,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:53,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-02 12:17:53,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:17:53,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:17:53,267 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:53,267 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-10-02 12:17:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:53,910 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-02 12:17:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 12:17:53,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-02 12:17:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:53,911 INFO L225 Difference]: With dead ends: 9 [2018-10-02 12:17:53,911 INFO L226 Difference]: Without dead ends: 8 [2018-10-02 12:17:53,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:17:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-02 12:17:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-02 12:17:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-02 12:17:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-02 12:17:53,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-02 12:17:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:53,917 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-02 12:17:53,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:17:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-02 12:17:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 12:17:53,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:53,918 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-02 12:17:53,918 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:53,919 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:53,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-02 12:17:53,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:53,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:53,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:53,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:17:53,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:54,078 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 12:17:54,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:54,078 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 12:17:54,090 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:17:54,097 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-02 12:17:54,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:54,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:54,139 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 12:17:54,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:54,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-02 12:17:54,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:17:54,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:17:54,160 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:54,160 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-10-02 12:17:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:54,400 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-02 12:17:54,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 12:17:54,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-02 12:17:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:54,401 INFO L225 Difference]: With dead ends: 10 [2018-10-02 12:17:54,401 INFO L226 Difference]: Without dead ends: 9 [2018-10-02 12:17:54,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:17:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-02 12:17:54,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-02 12:17:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-02 12:17:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-02 12:17:54,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-02 12:17:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:54,406 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-02 12:17:54,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:17:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-02 12:17:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 12:17:54,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:54,407 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-02 12:17:54,407 INFO L423 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:54,407 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-02 12:17:54,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:54,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:54,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:54,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:17:54,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:54,515 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 12:17:54,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:54,516 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 12:17:54,526 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:17:54,554 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-02 12:17:54,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:54,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:54,612 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 12:17:54,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:54,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 12:17:54,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:17:54,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:17:54,634 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:54,634 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-10-02 12:17:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:54,909 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-02 12:17:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:17:54,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-10-02 12:17:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:54,910 INFO L225 Difference]: With dead ends: 11 [2018-10-02 12:17:54,910 INFO L226 Difference]: Without dead ends: 10 [2018-10-02 12:17:54,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:17:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-02 12:17:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-02 12:17:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-02 12:17:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-02 12:17:54,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-02 12:17:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:54,914 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-02 12:17:54,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:17:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-02 12:17:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 12:17:54,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:54,915 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-02 12:17:54,915 INFO L423 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:54,916 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-02 12:17:54,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:54,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:54,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:17:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:55,035 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 12:17:55,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:55,035 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 12:17:55,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:55,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:55,181 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 12:17:55,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:55,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-02 12:17:55,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 12:17:55,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 12:17:55,203 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:55,203 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-10-02 12:17:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:55,530 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-02 12:17:55,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:17:55,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-10-02 12:17:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:55,531 INFO L225 Difference]: With dead ends: 12 [2018-10-02 12:17:55,532 INFO L226 Difference]: Without dead ends: 11 [2018-10-02 12:17:55,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime [2018-10-02 12:17:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-02 12:17:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-02 12:17:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-02 12:17:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-02 12:17:55,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-02 12:17:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:55,537 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-02 12:17:55,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 12:17:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-02 12:17:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 12:17:55,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:55,538 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-02 12:17:55,538 INFO L423 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:55,538 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-02 12:17:55,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:55,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:55,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:55,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:17:55,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:55,671 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 12:17:55,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:55,672 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 12:17:55,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:17:55,690 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:17:55,690 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:55,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:55,742 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 12:17:55,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:55,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-02 12:17:55,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 12:17:55,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 12:17:55,763 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:55,763 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-10-02 12:17:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:56,286 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-02 12:17:56,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:17:56,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-10-02 12:17:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:56,288 INFO L225 Difference]: With dead ends: 13 [2018-10-02 12:17:56,288 INFO L226 Difference]: Without dead ends: 12 [2018-10-02 12:17:56,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:17:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-02 12:17:56,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-02 12:17:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-02 12:17:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-02 12:17:56,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-02 12:17:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:56,293 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-02 12:17:56,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 12:17:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-02 12:17:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 12:17:56,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:56,294 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-02 12:17:56,294 INFO L423 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:56,294 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:56,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-02 12:17:56,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:56,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:56,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:56,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:17:56,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:56,423 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 12:17:56,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:56,424 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 12:17:56,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:17:56,439 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-02 12:17:56,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:56,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:56,473 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 12:17:56,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:56,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-02 12:17:56,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 12:17:56,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 12:17:56,496 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:56,496 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-10-02 12:17:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:57,103 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-02 12:17:57,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 12:17:57,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-02 12:17:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:57,104 INFO L225 Difference]: With dead ends: 14 [2018-10-02 12:17:57,104 INFO L226 Difference]: Without dead ends: 13 [2018-10-02 12:17:57,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:17:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-02 12:17:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-02 12:17:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-02 12:17:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-02 12:17:57,108 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-02 12:17:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:57,108 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-02 12:17:57,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 12:17:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-02 12:17:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:17:57,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:57,109 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-02 12:17:57,109 INFO L423 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:57,110 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:57,110 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-02 12:17:57,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:57,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:57,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:57,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:17:57,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:57,383 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 12:17:57,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:57,383 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 12:17:57,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:17:57,406 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:17:57,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:57,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:57,443 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 12:17:57,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:57,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-02 12:17:57,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 12:17:57,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 12:17:57,466 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:57,466 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-10-02 12:17:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:58,163 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-02 12:17:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:17:58,164 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-02 12:17:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:58,165 INFO L225 Difference]: With dead ends: 15 [2018-10-02 12:17:58,165 INFO L226 Difference]: Without dead ends: 14 [2018-10-02 12:17:58,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:17:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-02 12:17:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-02 12:17:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-02 12:17:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-02 12:17:58,170 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-02 12:17:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:58,170 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-02 12:17:58,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 12:17:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-02 12:17:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:17:58,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:58,171 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-02 12:17:58,171 INFO L423 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:58,172 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-02 12:17:58,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:58,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:58,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:17:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:58,394 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 12:17:58,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:58,394 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 12:17:58,408 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:17:58,418 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-02 12:17:58,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:58,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:58,459 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 12:17:58,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:58,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-02 12:17:58,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 12:17:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 12:17:58,481 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:58,482 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-10-02 12:17:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:17:59,077 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-02 12:17:59,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 12:17:59,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 12:17:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:17:59,083 INFO L225 Difference]: With dead ends: 16 [2018-10-02 12:17:59,084 INFO L226 Difference]: Without dead ends: 15 [2018-10-02 12:17:59,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime [2018-10-02 12:17:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-02 12:17:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-02 12:17:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-02 12:17:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-02 12:17:59,088 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-02 12:17:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:17:59,088 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-02 12:17:59,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 12:17:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-02 12:17:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-02 12:17:59,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:17:59,089 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-02 12:17:59,089 INFO L423 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:17:59,089 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:17:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-02 12:17:59,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:17:59,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:17:59,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:59,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:17:59,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:17:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:17:59,427 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 12:17:59,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:17:59,428 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 12:17:59,437 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:17:59,446 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-02 12:17:59,446 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:17:59,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:17:59,487 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 12:17:59,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:17:59,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-02 12:17:59,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 12:17:59,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 12:17:59,508 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:17:59,508 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-10-02 12:18:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:00,296 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-02 12:18:00,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:18:00,297 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-02 12:18:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:00,297 INFO L225 Difference]: With dead ends: 17 [2018-10-02 12:18:00,298 INFO L226 Difference]: Without dead ends: 16 [2018-10-02 12:18:00,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime [2018-10-02 12:18:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-02 12:18:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-02 12:18:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-02 12:18:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-02 12:18:00,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-02 12:18:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:00,303 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-02 12:18:00,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 12:18:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-02 12:18:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:18:00,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:00,303 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-02 12:18:00,304 INFO L423 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:00,304 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-02 12:18:00,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:00,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:00,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:00,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:00,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:00,543 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 12:18:00,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:00,543 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 12:18:00,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:00,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:00,604 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 12:18:00,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:00,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-02 12:18:00,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:18:00,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:18:00,625 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:00,625 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-10-02 12:18:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:01,465 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-02 12:18:01,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:18:01,465 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-02 12:18:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:01,466 INFO L225 Difference]: With dead ends: 18 [2018-10-02 12:18:01,466 INFO L226 Difference]: Without dead ends: 17 [2018-10-02 12:18:01,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:18:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-02 12:18:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-02 12:18:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-02 12:18:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-02 12:18:01,471 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-02 12:18:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:01,471 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-02 12:18:01,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:18:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-02 12:18:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:18:01,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:01,472 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-02 12:18:01,472 INFO L423 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:01,472 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-02 12:18:01,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:01,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:01,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:01,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:01,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 12:18:01,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:01,693 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 12:18:01,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:18:01,707 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:18:01,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:01,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:01,830 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 12:18:01,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:01,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-02 12:18:01,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:18:01,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:18:01,854 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:01,854 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-10-02 12:18:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:02,855 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-02 12:18:02,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:18:02,855 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 12:18:02,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:02,856 INFO L225 Difference]: With dead ends: 19 [2018-10-02 12:18:02,856 INFO L226 Difference]: Without dead ends: 18 [2018-10-02 12:18:02,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:18:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-02 12:18:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-02 12:18:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-02 12:18:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-02 12:18:02,861 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-02 12:18:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:02,862 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-02 12:18:02,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:18:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-02 12:18:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 12:18:02,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:02,863 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-02 12:18:02,863 INFO L423 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:02,863 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:02,863 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-02 12:18:02,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:02,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:02,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:02,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:02,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:03,346 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 12:18:03,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:03,347 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:18:03,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:18:03,363 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-02 12:18:03,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:03,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:03,461 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 12:18:03,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:03,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-02 12:18:03,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 12:18:03,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 12:18:03,483 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:03,483 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-10-02 12:18:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:04,468 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-02 12:18:04,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 12:18:04,469 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-10-02 12:18:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:04,470 INFO L225 Difference]: With dead ends: 20 [2018-10-02 12:18:04,470 INFO L226 Difference]: Without dead ends: 19 [2018-10-02 12:18:04,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:18:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-02 12:18:04,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-02 12:18:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-02 12:18:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-02 12:18:04,474 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-02 12:18:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:04,475 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-02 12:18:04,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 12:18:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-02 12:18:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 12:18:04,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:04,475 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-02 12:18:04,476 INFO L423 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:04,476 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:04,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-02 12:18:04,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:04,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:04,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:04,814 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 12:18:04,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:04,814 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 12:18:04,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:18:04,828 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:18:04,828 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:04,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:04,869 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 12:18:04,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:04,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-02 12:18:04,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 12:18:04,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 12:18:04,891 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:04,891 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-10-02 12:18:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:05,895 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-02 12:18:05,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 12:18:05,896 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-02 12:18:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:05,897 INFO L225 Difference]: With dead ends: 21 [2018-10-02 12:18:05,897 INFO L226 Difference]: Without dead ends: 20 [2018-10-02 12:18:05,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime [2018-10-02 12:18:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-02 12:18:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-02 12:18:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-02 12:18:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-02 12:18:05,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-02 12:18:05,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:05,901 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-02 12:18:05,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 12:18:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-02 12:18:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-02 12:18:05,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:05,902 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-02 12:18:05,903 INFO L423 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:05,903 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:05,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-02 12:18:05,903 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:05,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:05,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:05,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:05,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:06,714 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 12:18:06,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:06,714 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 12:18:06,723 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:18:06,731 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-02 12:18:06,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:06,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:06,950 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 12:18:06,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:06,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-02 12:18:06,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 12:18:06,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 12:18:06,973 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:06,973 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-10-02 12:18:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:08,250 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-02 12:18:08,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 12:18:08,250 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-10-02 12:18:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:08,251 INFO L225 Difference]: With dead ends: 22 [2018-10-02 12:18:08,251 INFO L226 Difference]: Without dead ends: 21 [2018-10-02 12:18:08,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime [2018-10-02 12:18:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-02 12:18:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-02 12:18:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-02 12:18:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-02 12:18:08,256 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-02 12:18:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:08,256 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-02 12:18:08,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 12:18:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-02 12:18:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 12:18:08,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:08,257 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-02 12:18:08,257 INFO L423 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:08,257 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-02 12:18:08,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:08,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:08,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:08,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:08,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:08,537 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 12:18:08,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:08,537 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 12:18:08,544 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:18:08,564 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-02 12:18:08,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:08,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:08,624 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 12:18:08,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:08,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-02 12:18:08,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 12:18:08,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 12:18:08,646 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:08,646 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-10-02 12:18:10,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:10,006 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-02 12:18:10,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 12:18:10,007 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-10-02 12:18:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:10,008 INFO L225 Difference]: With dead ends: 23 [2018-10-02 12:18:10,008 INFO L226 Difference]: Without dead ends: 22 [2018-10-02 12:18:10,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime [2018-10-02 12:18:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-02 12:18:10,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-02 12:18:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-02 12:18:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-02 12:18:10,012 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-02 12:18:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:10,013 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-02 12:18:10,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 12:18:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-02 12:18:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 12:18:10,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:10,014 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-02 12:18:10,014 INFO L423 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:10,014 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-02 12:18:10,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:10,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:10,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:10,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:10,357 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 12:18:10,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:10,358 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 12:18:10,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:10,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:10,483 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 12:18:10,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:10,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-02 12:18:10,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-02 12:18:10,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-02 12:18:10,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:10,514 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-10-02 12:18:11,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:11,998 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-02 12:18:11,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 12:18:11,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-10-02 12:18:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:11,999 INFO L225 Difference]: With dead ends: 24 [2018-10-02 12:18:11,999 INFO L226 Difference]: Without dead ends: 23 [2018-10-02 12:18:12,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:18:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-02 12:18:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-02 12:18:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-02 12:18:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-02 12:18:12,005 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-02 12:18:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:12,005 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-02 12:18:12,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-02 12:18:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-02 12:18:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 12:18:12,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:12,006 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-02 12:18:12,007 INFO L423 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:12,007 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:12,007 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-02 12:18:12,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:12,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:12,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:12,806 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 12:18:12,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:12,807 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 12:18:12,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:18:12,829 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:18:12,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:12,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:12,882 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 12:18:12,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:12,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-02 12:18:12,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-02 12:18:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-02 12:18:12,904 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:12,904 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-10-02 12:18:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:14,391 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-02 12:18:14,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:18:14,391 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-10-02 12:18:14,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:14,392 INFO L225 Difference]: With dead ends: 25 [2018-10-02 12:18:14,392 INFO L226 Difference]: Without dead ends: 24 [2018-10-02 12:18:14,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime [2018-10-02 12:18:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-02 12:18:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-02 12:18:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-02 12:18:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-02 12:18:14,397 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-02 12:18:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:14,397 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-02 12:18:14,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-02 12:18:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-02 12:18:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 12:18:14,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:14,398 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-02 12:18:14,398 INFO L423 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:14,398 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:14,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-02 12:18:14,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:14,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:14,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:14,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:14,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:14,852 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 12:18:14,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:14,853 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 12:18:14,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:18:14,873 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-02 12:18:14,873 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:14,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:14,931 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 12:18:14,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:14,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-02 12:18:14,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-02 12:18:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-02 12:18:14,954 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:14,954 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-10-02 12:18:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:16,704 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-02 12:18:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:18:16,712 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-10-02 12:18:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:16,712 INFO L225 Difference]: With dead ends: 26 [2018-10-02 12:18:16,712 INFO L226 Difference]: Without dead ends: 25 [2018-10-02 12:18:16,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime [2018-10-02 12:18:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-02 12:18:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-02 12:18:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-02 12:18:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-02 12:18:16,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-02 12:18:16,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:16,717 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-02 12:18:16,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-02 12:18:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-02 12:18:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 12:18:16,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:16,718 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-02 12:18:16,718 INFO L423 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:16,718 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:16,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-02 12:18:16,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:16,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:16,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:16,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:16,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:17,356 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 12:18:17,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:17,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 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 12:18:17,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:18:17,371 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:18:17,372 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:17,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:17,432 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 12:18:17,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:17,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-02 12:18:17,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-02 12:18:17,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-02 12:18:17,455 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:17,455 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-10-02 12:18:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:19,465 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-02 12:18:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 12:18:19,465 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-10-02 12:18:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:19,466 INFO L225 Difference]: With dead ends: 27 [2018-10-02 12:18:19,466 INFO L226 Difference]: Without dead ends: 26 [2018-10-02 12:18:19,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:18:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-02 12:18:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-02 12:18:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-02 12:18:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-02 12:18:19,472 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-02 12:18:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:19,472 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-02 12:18:19,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-02 12:18:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-02 12:18:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-02 12:18:19,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:19,473 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-02 12:18:19,473 INFO L423 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:19,473 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:19,473 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-02 12:18:19,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:19,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:19,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:19,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:19,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:19,914 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 12:18:19,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:19,915 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 12:18:19,922 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:18:19,933 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-02 12:18:19,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:19,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:20,006 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 12:18:20,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:20,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-02 12:18:20,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-02 12:18:20,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-02 12:18:20,026 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:20,026 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-10-02 12:18:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:22,351 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-02 12:18:22,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 12:18:22,352 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-10-02 12:18:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:22,352 INFO L225 Difference]: With dead ends: 28 [2018-10-02 12:18:22,353 INFO L226 Difference]: Without dead ends: 27 [2018-10-02 12:18:22,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime [2018-10-02 12:18:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-02 12:18:22,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-02 12:18:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-02 12:18:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-02 12:18:22,358 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-02 12:18:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:22,358 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-02 12:18:22,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-02 12:18:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-02 12:18:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 12:18:22,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:22,359 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-02 12:18:22,359 INFO L423 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:22,360 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-02 12:18:22,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:22,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:22,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:23,101 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 12:18:23,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:23,102 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 12:18:23,109 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:18:23,120 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-02 12:18:23,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:23,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:23,199 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 12:18:23,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:23,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-02 12:18:23,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-02 12:18:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-02 12:18:23,222 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:23,222 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-10-02 12:18:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:25,323 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-02 12:18:25,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:18:25,323 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-10-02 12:18:25,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:25,324 INFO L225 Difference]: With dead ends: 29 [2018-10-02 12:18:25,324 INFO L226 Difference]: Without dead ends: 28 [2018-10-02 12:18:25,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime [2018-10-02 12:18:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-02 12:18:25,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-02 12:18:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-02 12:18:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-02 12:18:25,329 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-02 12:18:25,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:25,330 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-02 12:18:25,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-02 12:18:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-02 12:18:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-02 12:18:25,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:25,331 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-02 12:18:25,331 INFO L423 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:25,331 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-02 12:18:25,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:25,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:25,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:25,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:25,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:25,850 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 12:18:25,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:25,850 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:18:25,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:25,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:25,935 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 12:18:25,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:25,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-02 12:18:25,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-02 12:18:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-02 12:18:25,956 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:25,956 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-10-02 12:18:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:28,325 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-02 12:18:28,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 12:18:28,326 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-10-02 12:18:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:28,327 INFO L225 Difference]: With dead ends: 30 [2018-10-02 12:18:28,327 INFO L226 Difference]: Without dead ends: 29 [2018-10-02 12:18:28,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime [2018-10-02 12:18:28,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-02 12:18:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-02 12:18:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-02 12:18:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-02 12:18:28,332 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-02 12:18:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:28,333 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-02 12:18:28,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-02 12:18:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-02 12:18:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 12:18:28,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:28,334 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-02 12:18:28,334 INFO L423 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:28,334 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:28,334 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-02 12:18:28,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:28,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:28,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:28,878 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 12:18:28,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:28,878 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 12:18:28,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:18:28,895 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:18:28,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:28,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:28,967 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 12:18:28,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:28,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-02 12:18:28,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-02 12:18:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-02 12:18:28,988 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:28,989 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-10-02 12:18:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:31,405 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-02 12:18:31,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 12:18:31,405 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-10-02 12:18:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:31,406 INFO L225 Difference]: With dead ends: 31 [2018-10-02 12:18:31,406 INFO L226 Difference]: Without dead ends: 30 [2018-10-02 12:18:31,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:18:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-02 12:18:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-02 12:18:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-02 12:18:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-02 12:18:31,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-02 12:18:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:31,412 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-02 12:18:31,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-02 12:18:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-02 12:18:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 12:18:31,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:31,413 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-02 12:18:31,413 INFO L423 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:31,413 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-02 12:18:31,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:31,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:31,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:31,940 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 12:18:31,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:31,941 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 12:18:31,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:18:31,971 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-02 12:18:31,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:31,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:32,086 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 12:18:32,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:32,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-02 12:18:32,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-02 12:18:32,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-02 12:18:32,107 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:32,107 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-10-02 12:18:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:34,853 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-02 12:18:34,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 12:18:34,853 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-10-02 12:18:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:34,854 INFO L225 Difference]: With dead ends: 32 [2018-10-02 12:18:34,854 INFO L226 Difference]: Without dead ends: 31 [2018-10-02 12:18:34,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:18:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-02 12:18:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-02 12:18:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-02 12:18:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-02 12:18:34,859 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-02 12:18:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:34,859 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-02 12:18:34,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-02 12:18:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-02 12:18:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 12:18:34,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:34,860 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-02 12:18:34,860 INFO L423 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:34,860 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:34,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-02 12:18:34,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:34,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:34,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:34,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:34,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:36,302 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 12:18:36,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:36,302 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 12:18:36,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:18:36,319 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:18:36,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:36,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:36,399 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 12:18:36,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:36,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-02 12:18:36,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-02 12:18:36,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-02 12:18:36,421 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:36,421 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-10-02 12:18:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:39,371 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-02 12:18:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 12:18:39,371 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-10-02 12:18:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:39,372 INFO L225 Difference]: With dead ends: 33 [2018-10-02 12:18:39,372 INFO L226 Difference]: Without dead ends: 32 [2018-10-02 12:18:39,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime [2018-10-02 12:18:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-02 12:18:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-02 12:18:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-02 12:18:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-02 12:18:39,378 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-02 12:18:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:39,378 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-02 12:18:39,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-02 12:18:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-02 12:18:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-02 12:18:39,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:39,379 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-02 12:18:39,379 INFO L423 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:39,380 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:39,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-02 12:18:39,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:39,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:39,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:39,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:39,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:39,987 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 12:18:39,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:39,988 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 12:18:40,001 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:18:40,028 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-02 12:18:40,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:40,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:40,109 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 12:18:40,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:40,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-02 12:18:40,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-02 12:18:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-02 12:18:40,132 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:40,132 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-10-02 12:18:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:43,131 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-02 12:18:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 12:18:43,132 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-10-02 12:18:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:43,132 INFO L225 Difference]: With dead ends: 34 [2018-10-02 12:18:43,132 INFO L226 Difference]: Without dead ends: 33 [2018-10-02 12:18:43,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime [2018-10-02 12:18:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-02 12:18:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-02 12:18:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-02 12:18:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-02 12:18:43,138 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-02 12:18:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:43,138 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-02 12:18:43,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-02 12:18:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-02 12:18:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-02 12:18:43,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:43,139 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-02 12:18:43,139 INFO L423 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:43,140 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:43,140 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-02 12:18:43,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:43,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:43,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:43,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:43,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:43,930 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 12:18:43,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:43,931 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 12:18:43,940 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:18:43,955 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-02 12:18:43,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:43,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:44,076 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 12:18:44,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-02 12:18:44,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-02 12:18:44,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-02 12:18:44,098 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:44,098 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-10-02 12:18:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:47,302 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-02 12:18:47,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-02 12:18:47,303 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-10-02 12:18:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:47,304 INFO L225 Difference]: With dead ends: 35 [2018-10-02 12:18:47,304 INFO L226 Difference]: Without dead ends: 34 [2018-10-02 12:18:47,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime [2018-10-02 12:18:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-02 12:18:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-02 12:18:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-02 12:18:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-02 12:18:47,309 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-02 12:18:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:47,309 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-02 12:18:47,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-02 12:18:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-02 12:18:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-02 12:18:47,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:47,310 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-02 12:18:47,310 INFO L423 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:47,310 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-02 12:18:47,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:47,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:47,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:47,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:48,610 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 12:18:48,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:48,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 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 12:18:48,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:48,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:48,708 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 12:18:48,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:48,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-02 12:18:48,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-02 12:18:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-02 12:18:48,729 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:48,729 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-10-02 12:18:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:52,106 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-02 12:18:52,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 12:18:52,106 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-10-02 12:18:52,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:52,107 INFO L225 Difference]: With dead ends: 36 [2018-10-02 12:18:52,107 INFO L226 Difference]: Without dead ends: 35 [2018-10-02 12:18:52,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime [2018-10-02 12:18:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-02 12:18:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-02 12:18:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-02 12:18:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-02 12:18:52,112 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-02 12:18:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:52,112 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-02 12:18:52,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-02 12:18:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-02 12:18:52,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-02 12:18:52,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:52,113 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-02 12:18:52,113 INFO L423 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:52,113 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:52,114 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-02 12:18:52,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:52,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:52,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:52,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:18:52,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:52,911 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 12:18:52,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:52,911 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 12:18:52,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:18:52,928 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:18:52,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:52,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:53,031 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 12:18:53,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:53,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-02 12:18:53,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-02 12:18:53,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-02 12:18:53,053 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:53,053 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-10-02 12:18:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:18:56,711 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-02 12:18:56,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-02 12:18:56,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-10-02 12:18:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:18:56,713 INFO L225 Difference]: With dead ends: 37 [2018-10-02 12:18:56,713 INFO L226 Difference]: Without dead ends: 36 [2018-10-02 12:18:56,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime [2018-10-02 12:18:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-02 12:18:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-02 12:18:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-02 12:18:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-02 12:18:56,718 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-02 12:18:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:18:56,718 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-02 12:18:56,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-02 12:18:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-02 12:18:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-02 12:18:56,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:18:56,719 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-02 12:18:56,720 INFO L423 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:18:56,721 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:18:56,721 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-02 12:18:56,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:18:56,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:18:56,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:56,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:18:56,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:18:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:18:57,573 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 12:18:57,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:18:57,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 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 12:18:57,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:18:57,599 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-02 12:18:57,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:18:57,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:18:57,789 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 12:18:57,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:18:57,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-02 12:18:57,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-02 12:18:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-02 12:18:57,810 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:18:57,810 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-10-02 12:19:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:19:01,891 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-02 12:19:01,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-02 12:19:01,892 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-10-02 12:19:01,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:19:01,892 INFO L225 Difference]: With dead ends: 38 [2018-10-02 12:19:01,893 INFO L226 Difference]: Without dead ends: 37 [2018-10-02 12:19:01,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime [2018-10-02 12:19:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-02 12:19:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-02 12:19:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-02 12:19:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-02 12:19:01,897 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-02 12:19:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:19:01,898 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-02 12:19:01,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-02 12:19:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-02 12:19:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 12:19:01,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:19:01,898 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-02 12:19:01,898 INFO L423 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:19:01,898 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:19:01,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-02 12:19:01,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:19:01,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:19:01,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:01,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:19:01,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:19:02,715 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 12:19:02,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:19:02,716 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 12:19:02,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:19:02,735 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:19:02,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:19:02,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:19:02,919 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 12:19:02,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:19:02,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-02 12:19:02,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-02 12:19:02,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-02 12:19:02,941 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:19:02,942 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-10-02 12:19:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:19:07,277 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-02 12:19:07,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-02 12:19:07,277 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-10-02 12:19:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:19:07,278 INFO L225 Difference]: With dead ends: 39 [2018-10-02 12:19:07,278 INFO L226 Difference]: Without dead ends: 38 [2018-10-02 12:19:07,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime [2018-10-02 12:19:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-02 12:19:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-02 12:19:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-02 12:19:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-02 12:19:07,282 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-02 12:19:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:19:07,282 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-02 12:19:07,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-02 12:19:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-02 12:19:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-02 12:19:07,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:19:07,283 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-02 12:19:07,283 INFO L423 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:19:07,283 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:19:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-02 12:19:07,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:19:07,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:19:07,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:07,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:19:07,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:19:08,204 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 12:19:08,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:19:08,204 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 12:19:08,212 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:19:08,228 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-02 12:19:08,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:19:08,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:19:08,319 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 12:19:08,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:19:08,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-02 12:19:08,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-02 12:19:08,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-02 12:19:08,341 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:19:08,341 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-10-02 12:19:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:19:12,839 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-02 12:19:12,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-02 12:19:12,839 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-10-02 12:19:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:19:12,840 INFO L225 Difference]: With dead ends: 40 [2018-10-02 12:19:12,840 INFO L226 Difference]: Without dead ends: 39 [2018-10-02 12:19:12,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime [2018-10-02 12:19:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-02 12:19:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-02 12:19:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-02 12:19:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-02 12:19:12,845 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-02 12:19:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:19:12,845 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-02 12:19:12,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-02 12:19:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-02 12:19:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-02 12:19:12,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:19:12,846 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-02 12:19:12,846 INFO L423 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:19:12,847 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:19:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-02 12:19:12,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:19:12,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:19:12,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:12,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:19:12,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:19:13,777 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 12:19:13,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:19:13,777 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 12:19:13,786 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:19:13,814 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-02 12:19:13,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:19:13,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:19:13,961 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 12:19:13,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:19:13,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-02 12:19:13,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-02 12:19:13,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-02 12:19:13,981 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:19:13,981 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-10-02 12:19:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:19:18,714 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-02 12:19:18,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 12:19:18,715 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-10-02 12:19:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:19:18,715 INFO L225 Difference]: With dead ends: 41 [2018-10-02 12:19:18,716 INFO L226 Difference]: Without dead ends: 40 [2018-10-02 12:19:18,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime [2018-10-02 12:19:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-02 12:19:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-02 12:19:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-02 12:19:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-02 12:19:18,719 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-02 12:19:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:19:18,719 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-02 12:19:18,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-02 12:19:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-02 12:19:18,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-02 12:19:18,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:19:18,720 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-02 12:19:18,720 INFO L423 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:19:18,720 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:19:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-02 12:19:18,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:19:18,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:19:18,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:18,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:19:18,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:19:19,854 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 12:19:19,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:19:19,854 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 12:19:19,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:19:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:19:19,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:19:19,944 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 12:19:19,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:19:19,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-02 12:19:19,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-02 12:19:19,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-02 12:19:19,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:19:19,965 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-10-02 12:19:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:19:24,759 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-02 12:19:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 12:19:24,760 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-10-02 12:19:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:19:24,761 INFO L225 Difference]: With dead ends: 42 [2018-10-02 12:19:24,761 INFO L226 Difference]: Without dead ends: 41 [2018-10-02 12:19:24,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime [2018-10-02 12:19:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-02 12:19:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-02 12:19:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-02 12:19:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-02 12:19:24,764 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-02 12:19:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:19:24,764 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-02 12:19:24,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-02 12:19:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-02 12:19:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-02 12:19:24,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:19:24,765 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-02 12:19:24,765 INFO L423 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:19:24,765 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:19:24,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-02 12:19:24,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:19:24,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:19:24,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:24,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:19:24,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:19:26,456 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 12:19:26,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:19:26,457 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 12:19:26,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:19:26,478 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:19:26,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:19:26,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:19:26,567 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 12:19:26,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:19:26,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-02 12:19:26,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-02 12:19:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-02 12:19:26,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:19:26,598 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-10-02 12:19:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:19:31,623 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-02 12:19:31,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-02 12:19:31,624 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-10-02 12:19:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:19:31,625 INFO L225 Difference]: With dead ends: 43 [2018-10-02 12:19:31,625 INFO L226 Difference]: Without dead ends: 42 [2018-10-02 12:19:31,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.5s impTime [2018-10-02 12:19:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-02 12:19:31,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-02 12:19:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-02 12:19:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-02 12:19:31,629 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-02 12:19:31,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:19:31,629 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-02 12:19:31,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-02 12:19:31,629 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-02 12:19:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-02 12:19:31,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:19:31,630 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-02 12:19:31,630 INFO L423 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:19:31,630 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:19:31,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-02 12:19:31,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:19:31,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:19:31,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:31,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:19:31,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:19:32,778 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 12:19:32,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:19:32,778 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 12:19:32,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:19:32,803 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-02 12:19:32,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:19:32,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:19:32,913 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 12:19:32,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:19:32,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-02 12:19:32,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-02 12:19:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-02 12:19:32,933 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:19:32,933 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-10-02 12:19:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:19:38,241 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-02 12:19:38,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-02 12:19:38,241 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-10-02 12:19:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:19:38,242 INFO L225 Difference]: With dead ends: 44 [2018-10-02 12:19:38,242 INFO L226 Difference]: Without dead ends: 43 [2018-10-02 12:19:38,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime [2018-10-02 12:19:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-02 12:19:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-02 12:19:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-02 12:19:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-02 12:19:38,246 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-02 12:19:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:19:38,246 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-02 12:19:38,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-02 12:19:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-02 12:19:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-02 12:19:38,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:19:38,246 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-02 12:19:38,247 INFO L423 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:19:38,247 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:19:38,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-02 12:19:38,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:19:38,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:19:38,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:38,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:19:38,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:19:39,273 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 12:19:39,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:19:39,273 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:19:39,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:19:39,290 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:19:39,290 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:19:39,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:19:39,410 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 12:19:39,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:19:39,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-02 12:19:39,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-02 12:19:39,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-02 12:19:39,431 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:19:39,431 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-10-02 12:19:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:19:45,161 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-02 12:19:45,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 12:19:45,162 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-10-02 12:19:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:19:45,162 INFO L225 Difference]: With dead ends: 45 [2018-10-02 12:19:45,163 INFO L226 Difference]: Without dead ends: 44 [2018-10-02 12:19:45,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime [2018-10-02 12:19:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-02 12:19:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-02 12:19:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-02 12:19:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-02 12:19:45,167 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-02 12:19:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:19:45,167 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-02 12:19:45,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-02 12:19:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-02 12:19:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-02 12:19:45,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:19:45,168 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-02 12:19:45,168 INFO L423 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:19:45,168 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:19:45,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-02 12:19:45,169 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:19:45,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:19:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:45,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:19:45,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:19:47,560 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 12:19:47,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:19:47,561 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 12:19:47,568 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:19:47,590 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-02 12:19:47,590 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:19:47,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:19:47,675 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 12:19:47,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:19:47,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-02 12:19:47,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-02 12:19:47,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-02 12:19:47,695 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:19:47,696 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-10-02 12:19:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:19:53,461 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-02 12:19:53,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-02 12:19:53,461 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-10-02 12:19:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:19:53,462 INFO L225 Difference]: With dead ends: 46 [2018-10-02 12:19:53,462 INFO L226 Difference]: Without dead ends: 45 [2018-10-02 12:19:53,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 2.0s impTime [2018-10-02 12:19:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-02 12:19:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-02 12:19:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-02 12:19:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-02 12:19:53,466 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-02 12:19:53,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:19:53,466 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-02 12:19:53,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-02 12:19:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-02 12:19:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-02 12:19:53,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:19:53,466 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-02 12:19:53,467 INFO L423 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:19:53,467 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:19:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-02 12:19:53,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:19:53,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:19:53,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:53,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:19:53,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:19:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:19:54,868 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 12:19:54,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:19:54,869 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 12:19:54,876 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:19:54,903 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-02 12:19:54,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:19:54,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:19:55,076 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 12:19:55,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:19:55,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-02 12:19:55,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-02 12:19:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-02 12:19:55,097 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:19:55,098 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-10-02 12:20:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:20:01,204 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-02 12:20:01,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-02 12:20:01,204 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-10-02 12:20:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:20:01,205 INFO L225 Difference]: With dead ends: 47 [2018-10-02 12:20:01,205 INFO L226 Difference]: Without dead ends: 46 [2018-10-02 12:20:01,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.1s impTime [2018-10-02 12:20:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-02 12:20:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-02 12:20:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-02 12:20:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-02 12:20:01,209 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-02 12:20:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:20:01,209 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-02 12:20:01,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-02 12:20:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-02 12:20:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-02 12:20:01,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:20:01,210 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-02 12:20:01,210 INFO L423 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:20:01,210 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:20:01,210 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-02 12:20:01,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:20:01,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:20:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:01,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:20:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:20:02,670 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 12:20:02,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:20:02,670 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:20:02,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:20:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:20:02,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:20:02,808 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 12:20:02,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:20:02,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-02 12:20:02,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-02 12:20:02,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-02 12:20:02,829 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:20:02,830 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-10-02 12:20:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:20:09,206 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-02 12:20:09,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-02 12:20:09,207 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-10-02 12:20:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:20:09,207 INFO L225 Difference]: With dead ends: 48 [2018-10-02 12:20:09,208 INFO L226 Difference]: Without dead ends: 47 [2018-10-02 12:20:09,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.2s impTime [2018-10-02 12:20:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-02 12:20:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-02 12:20:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-02 12:20:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-02 12:20:09,211 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-02 12:20:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:20:09,211 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-02 12:20:09,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-02 12:20:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-02 12:20:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 12:20:09,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:20:09,212 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-02 12:20:09,212 INFO L423 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:20:09,213 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:20:09,213 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-02 12:20:09,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:20:09,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:20:09,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:09,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:20:09,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:20:10,655 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 12:20:10,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:20:10,655 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 12:20:10,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:20:10,678 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:20:10,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:20:10,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:20:10,761 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 12:20:10,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:20:10,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-02 12:20:10,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-02 12:20:10,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-02 12:20:10,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:20:10,783 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-10-02 12:20:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:20:17,396 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-02 12:20:17,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 12:20:17,396 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-10-02 12:20:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:20:17,397 INFO L225 Difference]: With dead ends: 49 [2018-10-02 12:20:17,397 INFO L226 Difference]: Without dead ends: 48 [2018-10-02 12:20:17,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.2s impTime [2018-10-02 12:20:17,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-02 12:20:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-02 12:20:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-02 12:20:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-02 12:20:17,401 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-10-02 12:20:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:20:17,401 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-02 12:20:17,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-02 12:20:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-02 12:20:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-02 12:20:17,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:20:17,402 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-10-02 12:20:17,402 INFO L423 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:20:17,402 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:20:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-10-02 12:20:17,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:20:17,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:20:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:17,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:20:17,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:20:18,706 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 12:20:18,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:20:18,706 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 12:20:18,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:20:18,739 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-02 12:20:18,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:20:18,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:20:18,845 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 12:20:18,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:20:18,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-02 12:20:18,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-02 12:20:18,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-02 12:20:18,866 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:20:18,867 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-10-02 12:20:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:20:26,062 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-02 12:20:26,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 12:20:26,063 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-10-02 12:20:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:20:26,064 INFO L225 Difference]: With dead ends: 50 [2018-10-02 12:20:26,064 INFO L226 Difference]: Without dead ends: 49 [2018-10-02 12:20:26,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.1s impTime [2018-10-02 12:20:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-02 12:20:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-02 12:20:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-02 12:20:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-02 12:20:26,069 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-10-02 12:20:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:20:26,069 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-02 12:20:26,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-02 12:20:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-02 12:20:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-02 12:20:26,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:20:26,069 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-10-02 12:20:26,070 INFO L423 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:20:26,070 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:20:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-10-02 12:20:26,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:20:26,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:20:26,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:26,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:20:26,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:20:27,461 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 12:20:27,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:20:27,462 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:20:27,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:20:27,483 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:20:27,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:20:27,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:20:27,584 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 12:20:27,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:20:27,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-02 12:20:27,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-02 12:20:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-02 12:20:27,605 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:20:27,605 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-10-02 12:20:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:20:35,047 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-02 12:20:35,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 12:20:35,048 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-10-02 12:20:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:20:35,048 INFO L225 Difference]: With dead ends: 51 [2018-10-02 12:20:35,049 INFO L226 Difference]: Without dead ends: 50 [2018-10-02 12:20:35,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.2s impTime [2018-10-02 12:20:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-02 12:20:35,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-02 12:20:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-02 12:20:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-02 12:20:35,053 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-10-02 12:20:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:20:35,053 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-02 12:20:35,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-02 12:20:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-02 12:20:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-02 12:20:35,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:20:35,054 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-10-02 12:20:35,054 INFO L423 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:20:35,055 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:20:35,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-10-02 12:20:35,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:20:35,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:20:35,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:35,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:20:35,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:20:36,652 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 12:20:36,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:20:36,653 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 12:20:36,660 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:20:36,683 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-02 12:20:36,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:20:36,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:20:36,834 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 12:20:36,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:20:36,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-02 12:20:36,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-02 12:20:36,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-02 12:20:36,859 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:20:36,860 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-10-02 12:20:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:20:44,495 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-02 12:20:44,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-02 12:20:44,496 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-10-02 12:20:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:20:44,497 INFO L225 Difference]: With dead ends: 52 [2018-10-02 12:20:44,497 INFO L226 Difference]: Without dead ends: 51 [2018-10-02 12:20:44,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.4s impTime [2018-10-02 12:20:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-02 12:20:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-02 12:20:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-02 12:20:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-02 12:20:44,502 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-10-02 12:20:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:20:44,502 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-02 12:20:44,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-02 12:20:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-02 12:20:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-02 12:20:44,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:20:44,503 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-10-02 12:20:44,503 INFO L423 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:20:44,504 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:20:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-10-02 12:20:44,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:20:44,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:20:44,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:44,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:20:44,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:20:46,411 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 12:20:46,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:20:46,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 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 12:20:46,418 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:20:46,442 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-02 12:20:46,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:20:46,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:20:46,532 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 12:20:46,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:20:46,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-02 12:20:46,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-02 12:20:46,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-02 12:20:46,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:20:46,555 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-10-02 12:20:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:20:54,399 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-02 12:20:54,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-02 12:20:54,400 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-10-02 12:20:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:20:54,401 INFO L225 Difference]: With dead ends: 53 [2018-10-02 12:20:54,401 INFO L226 Difference]: Without dead ends: 52 [2018-10-02 12:20:54,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.6s impTime [2018-10-02 12:20:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-02 12:20:54,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-02 12:20:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-02 12:20:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-02 12:20:54,405 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-10-02 12:20:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:20:54,405 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-02 12:20:54,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-02 12:20:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-02 12:20:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-02 12:20:54,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:20:54,406 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-10-02 12:20:54,406 INFO L423 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:20:54,407 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:20:54,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-10-02 12:20:54,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:20:54,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:20:54,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:54,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:20:54,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:20:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:20:55,846 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 12:20:55,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:20:55,847 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 12:20:55,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:20:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:20:55,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:20:55,958 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 12:20:55,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:20:55,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-02 12:20:55,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-02 12:20:55,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-02 12:20:55,979 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:20:55,979 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-10-02 12:21:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:21:04,289 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-02 12:21:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-02 12:21:04,290 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-10-02 12:21:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:21:04,291 INFO L225 Difference]: With dead ends: 54 [2018-10-02 12:21:04,291 INFO L226 Difference]: Without dead ends: 53 [2018-10-02 12:21:04,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.3s impTime [2018-10-02 12:21:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-02 12:21:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-02 12:21:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-02 12:21:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-02 12:21:04,295 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-10-02 12:21:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:21:04,295 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-02 12:21:04,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-02 12:21:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-02 12:21:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-02 12:21:04,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:21:04,296 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-10-02 12:21:04,296 INFO L423 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:21:04,296 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:21:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-10-02 12:21:04,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:21:04,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:21:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:21:04,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:21:04,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:21:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:21:06,628 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 12:21:06,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:21:06,628 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 12:21:06,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 12:21:06,658 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 12:21:06,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:21:06,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:21:06,841 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 12:21:06,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:21:06,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-02 12:21:06,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-02 12:21:06,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-02 12:21:06,862 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:21:06,862 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-10-02 12:21:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:21:15,300 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-02 12:21:15,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-02 12:21:15,300 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-10-02 12:21:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:21:15,301 INFO L225 Difference]: With dead ends: 55 [2018-10-02 12:21:15,301 INFO L226 Difference]: Without dead ends: 54 [2018-10-02 12:21:15,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 2.0s impTime [2018-10-02 12:21:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-02 12:21:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-02 12:21:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-02 12:21:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-02 12:21:15,305 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-10-02 12:21:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:21:15,305 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-02 12:21:15,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-02 12:21:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-02 12:21:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-02 12:21:15,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:21:15,306 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-10-02 12:21:15,306 INFO L423 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:21:15,307 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:21:15,307 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-10-02 12:21:15,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:21:15,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:21:15,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:21:15,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:21:15,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:21:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:21:17,191 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 12:21:17,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:21:17,192 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 12:21:17,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 12:21:17,226 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-02 12:21:17,227 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:21:17,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:21:17,334 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 12:21:17,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:21:17,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-02 12:21:17,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-02 12:21:17,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-02 12:21:17,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:21:17,356 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-10-02 12:21:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:21:26,056 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-02 12:21:26,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-02 12:21:26,056 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-10-02 12:21:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:21:26,057 INFO L225 Difference]: With dead ends: 56 [2018-10-02 12:21:26,057 INFO L226 Difference]: Without dead ends: 55 [2018-10-02 12:21:26,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.6s impTime [2018-10-02 12:21:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-02 12:21:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-02 12:21:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-02 12:21:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-02 12:21:26,060 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-10-02 12:21:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:21:26,061 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-02 12:21:26,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-02 12:21:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-02 12:21:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-02 12:21:26,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:21:26,061 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-10-02 12:21:26,062 INFO L423 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:21:26,062 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:21:26,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-10-02 12:21:26,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:21:26,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:21:26,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:21:26,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:21:26,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:21:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:21:28,558 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 12:21:28,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:21:28,558 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 12:21:28,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 12:21:28,588 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 12:21:28,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:21:28,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:21:28,689 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 12:21:28,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:21:28,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-02 12:21:28,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-02 12:21:28,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-02 12:21:28,710 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:21:28,710 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-10-02 12:21:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:21:37,866 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-02 12:21:37,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 12:21:37,866 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-10-02 12:21:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:21:37,867 INFO L225 Difference]: With dead ends: 57 [2018-10-02 12:21:37,867 INFO L226 Difference]: Without dead ends: 56 [2018-10-02 12:21:37,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time 2.1s impTime [2018-10-02 12:21:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-02 12:21:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-02 12:21:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-02 12:21:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-02 12:21:37,870 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-10-02 12:21:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:21:37,871 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-02 12:21:37,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-02 12:21:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-02 12:21:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-02 12:21:37,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:21:37,872 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-10-02 12:21:37,872 INFO L423 AbstractCegarLoop]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:21:37,872 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:21:37,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-10-02 12:21:37,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:21:37,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:21:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:21:37,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:21:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:21:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:21:39,696 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 12:21:39,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:21:39,696 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 12:21:39,704 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 12:21:39,734 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-10-02 12:21:39,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:21:39,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:21:39,849 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 12:21:39,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:21:39,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-02 12:21:39,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-02 12:21:39,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-02 12:21:39,870 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:21:39,870 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-10-02 12:21:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:21:49,424 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-02 12:21:49,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 12:21:49,425 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-10-02 12:21:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:21:49,425 INFO L225 Difference]: With dead ends: 58 [2018-10-02 12:21:49,425 INFO L226 Difference]: Without dead ends: 57 [2018-10-02 12:21:49,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.6s impTime [2018-10-02 12:21:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-02 12:21:49,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-02 12:21:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 12:21:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-02 12:21:49,429 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-10-02 12:21:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:21:49,429 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-02 12:21:49,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-02 12:21:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-02 12:21:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-02 12:21:49,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:21:49,430 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-10-02 12:21:49,430 INFO L423 AbstractCegarLoop]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:21:49,430 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:21:49,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-10-02 12:21:49,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:21:49,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:21:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:21:49,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 12:21:49,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:21:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:21:51,528 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 12:21:51,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:21:51,528 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 12:21:51,535 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 12:21:51,565 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-02 12:21:51,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 12:21:51,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:21:51,677 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 12:21:51,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:21:51,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-02 12:21:51,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-02 12:21:51,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-02 12:21:51,698 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:21:51,698 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. Received shutdown request... [2018-10-02 12:21:59,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 12:21:59,563 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 12:21:59,571 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 12:21:59,571 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:21:59 BoogieIcfgContainer [2018-10-02 12:21:59,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:21:59,572 INFO L168 Benchmark]: Toolchain (without parser) took 248697.04 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -111.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 203.2 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB. [2018-10-02 12:21:59,574 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:21:59,574 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:21:59,575 INFO L168 Benchmark]: Boogie Preprocessor took 22.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:21:59,575 INFO L168 Benchmark]: RCFGBuilder took 262.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 12:21:59,576 INFO L168 Benchmark]: TraceAbstraction took 248363.92 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -111.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 182.0 MB). Peak memory consumption was 70.4 MB. Max. memory is 7.1 GB. [2018-10-02 12:21:59,579 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 262.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 248363.92 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -111.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 182.0 MB). Peak memory consumption was 70.4 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 (57states) and FLOYD_HOARE automaton (currently 47 states, 57 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 248.2s OverallTime, 55 OverallIterations, 54 TraceHistogramMax, 192.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 59401 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 57.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3079 GetRequests, 1485 SyntacticMatches, 54 SemanticMatches, 1540 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=54, 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.2s AutomataMinimizationTime, 54 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 52.1s InterpolantComputationTime, 3188 NumberOfCodeBlocks, 3188 NumberOfCodeBlocksAsserted, 514 NumberOfCheckSat, 3079 ConstructedInterpolants, 0 QuantifiedInterpolants, 797713 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3240 ConjunctsInSsa, 3132 ConjunctsInUnsatCore, 109 InterpolantComputations, 1 PerfectInterpolantSequences, 0/55440 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-21-59-590.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-21-59-590.csv Completed graceful shutdown