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-d19836b [2018-09-26 21:55:06,240 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:55:06,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:55:06,254 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:55:06,254 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:55:06,255 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:55:06,256 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:55:06,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:55:06,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:55:06,260 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:55:06,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:55:06,261 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:55:06,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:55:06,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:55:06,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:55:06,265 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:55:06,266 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:55:06,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:55:06,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:55:06,271 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:55:06,272 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:55:06,273 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:55:06,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:55:06,276 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:55:06,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:55:06,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:55:06,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:55:06,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:55:06,279 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:55:06,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:55:06,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:55:06,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:55:06,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:55:06,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:55:06,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:55:06,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:55:06,284 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-09-26 21:55:06,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:55:06,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:55:06,307 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:55:06,307 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:55:06,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:55:06,308 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:55:06,308 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:55:06,308 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:55:06,309 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:55:06,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:55:06,309 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:55:06,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:55:06,309 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:55:06,309 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:55:06,310 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:55:06,310 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:55:06,310 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:55:06,310 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:55:06,312 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:55:06,312 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:55:06,312 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:55:06,312 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:55:06,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:55:06,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:55:06,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:55:06,313 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:55:06,313 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:55:06,314 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:55:06,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:55:06,314 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:55:06,314 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:55:06,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:55:06,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:55:06,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:55:06,393 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:55:06,393 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:55:06,394 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-09-26 21:55:06,395 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl' [2018-09-26 21:55:06,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:55:06,441 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:55:06,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:55:06,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:55:06,442 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:55:06,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (1/1) ... [2018-09-26 21:55:06,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (1/1) ... [2018-09-26 21:55:06,480 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:55:06,480 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:55:06,481 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:55:06,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:55:06,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:55:06,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:55:06,484 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:55:06,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (1/1) ... [2018-09-26 21:55:06,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (1/1) ... [2018-09-26 21:55:06,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (1/1) ... [2018-09-26 21:55:06,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (1/1) ... [2018-09-26 21:55:06,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (1/1) ... [2018-09-26 21:55:06,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (1/1) ... [2018-09-26 21:55:06,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (1/1) ... [2018-09-26 21:55:06,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:55:06,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:55:06,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:55:06,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:55:06,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (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-09-26 21:55:06,579 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-09-26 21:55:06,579 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-09-26 21:55:06,717 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:55:06,718 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:55:06 BoogieIcfgContainer [2018-09-26 21:55:06,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:55:06,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:55:06,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:55:06,724 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:55:06,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:55:06" (1/2) ... [2018-09-26 21:55:06,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e75c09 and model type DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:55:06, skipping insertion in model container [2018-09-26 21:55:06,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:55:06" (2/2) ... [2018-09-26 21:55:06,733 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-09-26 21:55:06,748 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:55:06,755 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:55:06,800 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:55:06,801 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:55:06,801 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:55:06,801 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:55:06,801 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:55:06,801 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:55:06,802 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:55:06,802 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:55:06,802 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:55:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 21:55:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-26 21:55:06,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:06,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-26 21:55:06,825 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:06,832 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-09-26 21:55:06,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:06,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:06,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:06,985 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:55:06,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 21:55:06,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:55:07,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:55:07,002 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:07,004 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 21:55:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:07,200 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 21:55:07,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:55:07,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-26 21:55:07,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:07,215 INFO L225 Difference]: With dead ends: 9 [2018-09-26 21:55:07,215 INFO L226 Difference]: Without dead ends: 4 [2018-09-26 21:55:07,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-09-26 21:55:07,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-09-26 21:55:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-09-26 21:55:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-09-26 21:55:07,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-09-26 21:55:07,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:07,252 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-09-26 21:55:07,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:55:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-09-26 21:55:07,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 21:55:07,253 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:07,253 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 21:55:07,254 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:07,254 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:07,254 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-09-26 21:55:07,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:07,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:07,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:07,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:07,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:07,368 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:07,368 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:55:07,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:07,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:07,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:07,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-09-26 21:55:07,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:55:07,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:55:07,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:07,445 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-09-26 21:55:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:07,538 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-09-26 21:55:07,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:55:07,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-26 21:55:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:07,543 INFO L225 Difference]: With dead ends: 6 [2018-09-26 21:55:07,543 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 21:55:07,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 21:55:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 21:55:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 21:55:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 21:55:07,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 21:55:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:07,550 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 21:55:07,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:55:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 21:55:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:55:07,550 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:07,551 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-09-26 21:55:07,552 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:07,552 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:07,552 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-09-26 21:55:07,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:07,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:07,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:07,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:07,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:07,660 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:07,661 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-09-26 21:55:07,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:55:07,676 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:55:07,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:07,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:07,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:07,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-26 21:55:07,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:55:07,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:55:07,753 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:07,753 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-09-26 21:55:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:08,085 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-26 21:55:08,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:55:08,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 21:55:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:08,087 INFO L225 Difference]: With dead ends: 7 [2018-09-26 21:55:08,087 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 21:55:08,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 21:55:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 21:55:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 21:55:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 21:55:08,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 21:55:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:08,091 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 21:55:08,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:55:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 21:55:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:55:08,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:08,092 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-09-26 21:55:08,092 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:08,093 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:08,093 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-09-26 21:55:08,093 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:08,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:08,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:08,206 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:08,207 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-09-26 21:55:08,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:55:08,221 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-26 21:55:08,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:08,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:08,264 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:08,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-26 21:55:08,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:55:08,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:55:08,265 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:08,265 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-09-26 21:55:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:08,577 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 21:55:08,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:55:08,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 21:55:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:08,579 INFO L225 Difference]: With dead ends: 8 [2018-09-26 21:55:08,579 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 21:55:08,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 21:55:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 21:55:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 21:55:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 21:55:08,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 21:55:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:08,583 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 21:55:08,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:55:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 21:55:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 21:55:08,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:08,584 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-09-26 21:55:08,586 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:08,586 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:08,586 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-09-26 21:55:08,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:08,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:08,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:08,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:08,704 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:08,704 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-09-26 21:55:08,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:55:08,722 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:55:08,722 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:08,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:08,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:08,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-26 21:55:08,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:55:08,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:55:08,787 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:08,787 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-09-26 21:55:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:09,450 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 21:55:09,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:55:09,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 21:55:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:09,452 INFO L225 Difference]: With dead ends: 9 [2018-09-26 21:55:09,452 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 21:55:09,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 21:55:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 21:55:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 21:55:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 21:55:09,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 21:55:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:09,457 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 21:55:09,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:55:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 21:55:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:55:09,458 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:09,458 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-09-26 21:55:09,458 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:09,458 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-09-26 21:55:09,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:09,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:09,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:09,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:09,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:09,610 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:09,610 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-09-26 21:55:09,618 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:55:09,626 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-26 21:55:09,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:09,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:09,680 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:09,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-26 21:55:09,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:55:09,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:55:09,681 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:09,681 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-09-26 21:55:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:09,985 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 21:55:09,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:55:09,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 21:55:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:09,986 INFO L225 Difference]: With dead ends: 10 [2018-09-26 21:55:09,987 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 21:55:09,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 21:55:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 21:55:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 21:55:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 21:55:09,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 21:55:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:09,990 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 21:55:09,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:55:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 21:55:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:55:09,991 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:09,991 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-09-26 21:55:09,992 INFO L423 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:09,992 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:09,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-09-26 21:55:09,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:09,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:09,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:10,386 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:10,387 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-09-26 21:55:10,396 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:55:10,401 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-09-26 21:55:10,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:10,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:10,501 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:10,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:55:10,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:55:10,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:55:10,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:10,502 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-09-26 21:55:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:10,828 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 21:55:10,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:55:10,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-09-26 21:55:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:10,830 INFO L225 Difference]: With dead ends: 11 [2018-09-26 21:55:10,830 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 21:55:10,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 21:55:10,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 21:55:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 21:55:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 21:55:10,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 21:55:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:10,835 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 21:55:10,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:55:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 21:55:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 21:55:10,836 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:10,836 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-09-26 21:55:10,836 INFO L423 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:10,836 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:10,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-09-26 21:55:10,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:10,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:10,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:10,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:10,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:11,054 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:11,055 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-09-26 21:55:11,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:11,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:11,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:11,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-26 21:55:11,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:55:11,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:55:11,186 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:11,186 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-09-26 21:55:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:11,536 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 21:55:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:55:11,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-09-26 21:55:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:11,538 INFO L225 Difference]: With dead ends: 12 [2018-09-26 21:55:11,538 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 21:55:11,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 21:55:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 21:55:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 21:55:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 21:55:11,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 21:55:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:11,542 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 21:55:11,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:55:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 21:55:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:55:11,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:11,543 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-09-26 21:55:11,543 INFO L423 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:11,544 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:11,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-09-26 21:55:11,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:11,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:11,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:11,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:11,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:11,691 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:11,691 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-09-26 21:55:11,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:55:11,704 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:55:11,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:11,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:11,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:11,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-09-26 21:55:11,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:55:11,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:55:11,775 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:11,775 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-09-26 21:55:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:12,164 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 21:55:12,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:55:12,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-09-26 21:55:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:12,165 INFO L225 Difference]: With dead ends: 13 [2018-09-26 21:55:12,166 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 21:55:12,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 21:55:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 21:55:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 21:55:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 21:55:12,170 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 21:55:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:12,170 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 21:55:12,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:55:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 21:55:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 21:55:12,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:12,171 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-09-26 21:55:12,171 INFO L423 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:12,172 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-09-26 21:55:12,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:12,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:12,505 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:12,505 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-09-26 21:55:12,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:55:12,525 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-26 21:55:12,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:12,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:12,586 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:12,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-09-26 21:55:12,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:55:12,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:55:12,587 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:12,587 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-09-26 21:55:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:13,115 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 21:55:13,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:55:13,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-26 21:55:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:13,116 INFO L225 Difference]: With dead ends: 14 [2018-09-26 21:55:13,116 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 21:55:13,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 21:55:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 21:55:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 21:55:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 21:55:13,121 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 21:55:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:13,121 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 21:55:13,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:55:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 21:55:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:55:13,122 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:13,122 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-09-26 21:55:13,122 INFO L423 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:13,122 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:13,123 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-09-26 21:55:13,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:13,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:13,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:13,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:13,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:13,369 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:13,369 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-09-26 21:55:13,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:55:13,393 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:55:13,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:13,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:13,455 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:13,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-09-26 21:55:13,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 21:55:13,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 21:55:13,456 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:13,456 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-09-26 21:55:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:14,074 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 21:55:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:55:14,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-26 21:55:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:14,075 INFO L225 Difference]: With dead ends: 15 [2018-09-26 21:55:14,076 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 21:55:14,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 21:55:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 21:55:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 21:55:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 21:55:14,080 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 21:55:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:14,080 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 21:55:14,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 21:55:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 21:55:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:55:14,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:14,081 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-09-26 21:55:14,081 INFO L423 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:14,082 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:14,082 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-09-26 21:55:14,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:14,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:14,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:14,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:14,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:14,287 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:14,287 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-09-26 21:55:14,301 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:55:14,311 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-26 21:55:14,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:14,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:14,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:14,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-09-26 21:55:14,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:55:14,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:55:14,377 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:14,377 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-09-26 21:55:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:14,966 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 21:55:14,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:55:14,966 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 21:55:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:14,967 INFO L225 Difference]: With dead ends: 16 [2018-09-26 21:55:14,968 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 21:55:14,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 21:55:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 21:55:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 21:55:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 21:55:14,972 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 21:55:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:14,972 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 21:55:14,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:55:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 21:55:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:55:14,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:14,973 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-09-26 21:55:14,973 INFO L423 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:14,973 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:14,973 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-09-26 21:55:14,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:14,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:14,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:14,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:14,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:15,394 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:15,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 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-09-26 21:55:15,403 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:55:15,412 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-26 21:55:15,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:15,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:15,613 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:15,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-09-26 21:55:15,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 21:55:15,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 21:55:15,614 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:15,614 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-09-26 21:55:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:16,392 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 21:55:16,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:55:16,392 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-09-26 21:55:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:16,393 INFO L225 Difference]: With dead ends: 17 [2018-09-26 21:55:16,394 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 21:55:16,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:16,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 21:55:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 21:55:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 21:55:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 21:55:16,399 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 21:55:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:16,399 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 21:55:16,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 21:55:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 21:55:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 21:55:16,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:16,400 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-09-26 21:55:16,400 INFO L423 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:16,400 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:16,400 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-09-26 21:55:16,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:16,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:16,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:16,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:16,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:16,712 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:16,712 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:55:16,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:16,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:16,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:16,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-09-26 21:55:16,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:55:16,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:55:16,895 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:16,895 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-09-26 21:55:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:19,223 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 21:55:19,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:55:19,224 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-26 21:55:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:19,225 INFO L225 Difference]: With dead ends: 18 [2018-09-26 21:55:19,225 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 21:55:19,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 21:55:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 21:55:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 21:55:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 21:55:19,229 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 21:55:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:19,230 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 21:55:19,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:55:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 21:55:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:55:19,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:19,231 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-09-26 21:55:19,231 INFO L423 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:19,231 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-09-26 21:55:19,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:19,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:19,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:19,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:19,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:19,490 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:19,490 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-09-26 21:55:19,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:55:19,517 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:55:19,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:19,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:19,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:19,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-09-26 21:55:19,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:55:19,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:55:19,660 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:19,661 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-09-26 21:55:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:20,634 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 21:55:20,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:55:20,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:55:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:20,635 INFO L225 Difference]: With dead ends: 19 [2018-09-26 21:55:20,635 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 21:55:20,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 21:55:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 21:55:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 21:55:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 21:55:20,640 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 21:55:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:20,641 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 21:55:20,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:55:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 21:55:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:55:20,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:20,641 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-09-26 21:55:20,642 INFO L423 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:20,642 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-09-26 21:55:20,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:20,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:20,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:20,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:20,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:21,154 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:21,154 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:55:21,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:55:21,175 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-09-26 21:55:21,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:21,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:21,294 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:21,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-09-26 21:55:21,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:55:21,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:55:21,295 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:21,295 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-09-26 21:55:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:22,393 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 21:55:22,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:55:22,394 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-09-26 21:55:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:22,395 INFO L225 Difference]: With dead ends: 20 [2018-09-26 21:55:22,395 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 21:55:22,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 21:55:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 21:55:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 21:55:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 21:55:22,399 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 21:55:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:22,399 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 21:55:22,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:55:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 21:55:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 21:55:22,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:22,400 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-09-26 21:55:22,400 INFO L423 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:22,400 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:22,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-09-26 21:55:22,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:22,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:22,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:22,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:22,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:22,795 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:22,795 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-09-26 21:55:22,804 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:55:22,810 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:55:22,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:22,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:22,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:22,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-09-26 21:55:22,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 21:55:22,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 21:55:22,880 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:22,880 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-09-26 21:55:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:23,978 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 21:55:23,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:55:23,980 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-09-26 21:55:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:23,980 INFO L225 Difference]: With dead ends: 21 [2018-09-26 21:55:23,981 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 21:55:23,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 21:55:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 21:55:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 21:55:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 21:55:23,985 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 21:55:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:23,985 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 21:55:23,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 21:55:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 21:55:23,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 21:55:23,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:23,986 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-09-26 21:55:23,986 INFO L423 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:23,986 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:23,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-09-26 21:55:23,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:23,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:23,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:24,798 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:24,798 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:55:24,806 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:55:24,823 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-09-26 21:55:24,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:24,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:25,067 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:25,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-09-26 21:55:25,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:55:25,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:55:25,068 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:25,068 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-09-26 21:55:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:26,373 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 21:55:26,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:55:26,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-09-26 21:55:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:26,374 INFO L225 Difference]: With dead ends: 22 [2018-09-26 21:55:26,374 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 21:55:26,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:26,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 21:55:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 21:55:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 21:55:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 21:55:26,378 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 21:55:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:26,378 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 21:55:26,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:55:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 21:55:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:55:26,379 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:26,379 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-09-26 21:55:26,379 INFO L423 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:26,379 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:26,379 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-09-26 21:55:26,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:26,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:26,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:26,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:26,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:26,752 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:26,752 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-09-26 21:55:26,763 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:55:26,795 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-09-26 21:55:26,795 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:26,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:26,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:26,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-09-26 21:55:26,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 21:55:26,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 21:55:26,886 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:26,887 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-09-26 21:55:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:28,224 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 21:55:28,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:55:28,224 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-09-26 21:55:28,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:28,225 INFO L225 Difference]: With dead ends: 23 [2018-09-26 21:55:28,226 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 21:55:28,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 21:55:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 21:55:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 21:55:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 21:55:28,230 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 21:55:28,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:28,230 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 21:55:28,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 21:55:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 21:55:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 21:55:28,231 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:28,231 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-09-26 21:55:28,232 INFO L423 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:28,232 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:28,232 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-09-26 21:55:28,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:28,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:28,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:28,680 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:28,680 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-09-26 21:55:28,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:28,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:28,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:28,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-09-26 21:55:28,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 21:55:28,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 21:55:28,993 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:28,993 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-09-26 21:55:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:30,401 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 21:55:30,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 21:55:30,401 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-09-26 21:55:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:30,402 INFO L225 Difference]: With dead ends: 24 [2018-09-26 21:55:30,402 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 21:55:30,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 21:55:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 21:55:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 21:55:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 21:55:30,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 21:55:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:30,408 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 21:55:30,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 21:55:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 21:55:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 21:55:30,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:30,409 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-09-26 21:55:30,409 INFO L423 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:30,409 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-09-26 21:55:30,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:30,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:30,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:30,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:31,228 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:31,228 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-09-26 21:55:31,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:55:31,246 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:55:31,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:31,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:31,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:31,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-09-26 21:55:31,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 21:55:31,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 21:55:31,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:31,396 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-09-26 21:55:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:33,048 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 21:55:33,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:55:33,049 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-09-26 21:55:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:33,049 INFO L225 Difference]: With dead ends: 25 [2018-09-26 21:55:33,050 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 21:55:33,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 21:55:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 21:55:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 21:55:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 21:55:33,054 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 21:55:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:33,054 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 21:55:33,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 21:55:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 21:55:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 21:55:33,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:33,055 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-09-26 21:55:33,056 INFO L423 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:33,056 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:33,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-09-26 21:55:33,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:33,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:33,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:33,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:33,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:33,557 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:33,557 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-09-26 21:55:33,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:55:33,583 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-09-26 21:55:33,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:33,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:33,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:33,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-09-26 21:55:33,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 21:55:33,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 21:55:33,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:33,683 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-09-26 21:55:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:35,414 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 21:55:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:55:35,416 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-09-26 21:55:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:35,417 INFO L225 Difference]: With dead ends: 26 [2018-09-26 21:55:35,417 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 21:55:35,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 21:55:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 21:55:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 21:55:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 21:55:35,421 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 21:55:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:35,421 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 21:55:35,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 21:55:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 21:55:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 21:55:35,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:35,422 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-09-26 21:55:35,422 INFO L423 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:35,422 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-09-26 21:55:35,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:35,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:35,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:35,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:36,125 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:36,125 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-09-26 21:55:36,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:55:36,139 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:55:36,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:36,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:36,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:36,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-09-26 21:55:36,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 21:55:36,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 21:55:36,227 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:36,227 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-09-26 21:55:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:38,316 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 21:55:38,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:55:38,317 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-09-26 21:55:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:38,318 INFO L225 Difference]: With dead ends: 27 [2018-09-26 21:55:38,318 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 21:55:38,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 21:55:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 21:55:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 21:55:38,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 21:55:38,324 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 21:55:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:38,324 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 21:55:38,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 21:55:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 21:55:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 21:55:38,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:38,325 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-09-26 21:55:38,325 INFO L423 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:38,325 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:38,325 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-09-26 21:55:38,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:38,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:38,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:38,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:38,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:39,369 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:39,370 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-09-26 21:55:39,379 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:55:39,390 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-09-26 21:55:39,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:39,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:39,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:39,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-09-26 21:55:39,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 21:55:39,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 21:55:39,495 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:39,495 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-09-26 21:55:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:42,025 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 21:55:42,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 21:55:42,026 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-09-26 21:55:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:42,026 INFO L225 Difference]: With dead ends: 28 [2018-09-26 21:55:42,027 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 21:55:42,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 21:55:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 21:55:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 21:55:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 21:55:42,031 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 21:55:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:42,032 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 21:55:42,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 21:55:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 21:55:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 21:55:42,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:42,032 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-09-26 21:55:42,033 INFO L423 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:42,033 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-09-26 21:55:42,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:42,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:42,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:42,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:42,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:42,975 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:42,975 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-09-26 21:55:42,984 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:55:43,001 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-26 21:55:43,001 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:43,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:43,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:43,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-09-26 21:55:43,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 21:55:43,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 21:55:43,120 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:43,121 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-09-26 21:55:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:45,355 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 21:55:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:55:45,355 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-09-26 21:55:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:45,356 INFO L225 Difference]: With dead ends: 29 [2018-09-26 21:55:45,356 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 21:55:45,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 21:55:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 21:55:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 21:55:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 21:55:45,363 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 21:55:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:45,363 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 21:55:45,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 21:55:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 21:55:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 21:55:45,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:45,364 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-09-26 21:55:45,364 INFO L423 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:45,364 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:45,365 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-09-26 21:55:45,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:45,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:45,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:45,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:45,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:46,034 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:46,034 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-09-26 21:55:46,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:46,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:46,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:46,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-09-26 21:55:46,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 21:55:46,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 21:55:46,148 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:46,148 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-09-26 21:55:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:48,673 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 21:55:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:55:48,673 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-09-26 21:55:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:48,674 INFO L225 Difference]: With dead ends: 30 [2018-09-26 21:55:48,674 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 21:55:48,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 21:55:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 21:55:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 21:55:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 21:55:48,679 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 21:55:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:48,680 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 21:55:48,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 21:55:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 21:55:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 21:55:48,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:48,680 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-09-26 21:55:48,681 INFO L423 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:48,681 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-09-26 21:55:48,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:48,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:48,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:55:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:49,368 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:49,368 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:55:49,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:55:49,385 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:55:49,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:49,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:49,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:49,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-09-26 21:55:49,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 21:55:49,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 21:55:49,475 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:49,475 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-09-26 21:55:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:52,262 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 21:55:52,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:55:52,263 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-09-26 21:55:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:52,264 INFO L225 Difference]: With dead ends: 31 [2018-09-26 21:55:52,264 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 21:55:52,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 21:55:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 21:55:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 21:55:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 21:55:52,269 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 21:55:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:52,269 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 21:55:52,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 21:55:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 21:55:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 21:55:52,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:52,270 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-09-26 21:55:52,270 INFO L423 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:52,271 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-09-26 21:55:52,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:52,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:52,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:52,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:53,019 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:53,019 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-09-26 21:55:53,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:55:53,050 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-09-26 21:55:53,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:53,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:53,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:53,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-09-26 21:55:53,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 21:55:53,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 21:55:53,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:53,152 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-09-26 21:55:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:55,844 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 21:55:55,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:55:55,846 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-09-26 21:55:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:55,846 INFO L225 Difference]: With dead ends: 32 [2018-09-26 21:55:55,846 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 21:55:55,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 21:55:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 21:55:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 21:55:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 21:55:55,851 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 21:55:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:55,852 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 21:55:55,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 21:55:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 21:55:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:55:55,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:55,852 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-09-26 21:55:55,852 INFO L423 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:55,853 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-09-26 21:55:55,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:55,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:55,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:55,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:55,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:55:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:56,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:55:56,639 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-09-26 21:55:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:55:56,659 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:55:56,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:55:56,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:55:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:55:56,775 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:55:56,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-09-26 21:55:56,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 21:55:56,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 21:55:56,776 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:55:56,776 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-09-26 21:55:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:55:59,911 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 21:55:59,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 21:55:59,911 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-09-26 21:55:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:55:59,912 INFO L225 Difference]: With dead ends: 33 [2018-09-26 21:55:59,912 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 21:55:59,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:55:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 21:55:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 21:55:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 21:55:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 21:55:59,918 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 21:55:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:55:59,919 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 21:55:59,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 21:55:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 21:55:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 21:55:59,919 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:55:59,919 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-09-26 21:55:59,920 INFO L423 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:55:59,920 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:55:59,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-09-26 21:55:59,920 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:55:59,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:55:59,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:59,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:55:59,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:55:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:01,006 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:01,006 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:56:01,019 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:56:01,033 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-09-26 21:56:01,033 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:56:01,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:01,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:01,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-09-26 21:56:01,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 21:56:01,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 21:56:01,139 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:01,139 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-09-26 21:56:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:56:04,405 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 21:56:04,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 21:56:04,405 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-09-26 21:56:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:56:04,406 INFO L225 Difference]: With dead ends: 34 [2018-09-26 21:56:04,406 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 21:56:04,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:56:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 21:56:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 21:56:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 21:56:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 21:56:04,411 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 21:56:04,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:56:04,411 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 21:56:04,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 21:56:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 21:56:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 21:56:04,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:56:04,412 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-09-26 21:56:04,412 INFO L423 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:56:04,412 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:56:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-09-26 21:56:04,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:56:04,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:56:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:04,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:56:04,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:05,589 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:05,589 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-09-26 21:56:05,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:56:05,614 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-09-26 21:56:05,615 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:56:05,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:05,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:05,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-09-26 21:56:05,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 21:56:05,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 21:56:05,796 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:05,796 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-09-26 21:56:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:56:09,241 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 21:56:09,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 21:56:09,241 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-09-26 21:56:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:56:09,242 INFO L225 Difference]: With dead ends: 35 [2018-09-26 21:56:09,242 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 21:56:09,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:56:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 21:56:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 21:56:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 21:56:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 21:56:09,247 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 21:56:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:56:09,247 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 21:56:09,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 21:56:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 21:56:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 21:56:09,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:56:09,248 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-09-26 21:56:09,248 INFO L423 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:56:09,249 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:56:09,249 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-09-26 21:56:09,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:56:09,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:56:09,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:09,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:56:09,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:10,848 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:10,848 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-09-26 21:56:10,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:56:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:10,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:11,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:11,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-09-26 21:56:11,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 21:56:11,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 21:56:11,003 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:11,003 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-09-26 21:56:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:56:14,590 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 21:56:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 21:56:14,591 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-09-26 21:56:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:56:14,591 INFO L225 Difference]: With dead ends: 36 [2018-09-26 21:56:14,592 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 21:56:14,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:56:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 21:56:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 21:56:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 21:56:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 21:56:14,596 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 21:56:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:56:14,597 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 21:56:14,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 21:56:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 21:56:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:56:14,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:56:14,597 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-09-26 21:56:14,597 INFO L423 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:56:14,598 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:56:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-09-26 21:56:14,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:56:14,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:56:14,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:14,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:56:14,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:15,684 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:15,685 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-09-26 21:56:15,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:56:15,706 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:56:15,706 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:56:15,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:15,853 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:15,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-09-26 21:56:15,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 21:56:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 21:56:15,854 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:15,854 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-09-26 21:56:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:56:19,607 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 21:56:19,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 21:56:19,608 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-09-26 21:56:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:56:19,608 INFO L225 Difference]: With dead ends: 37 [2018-09-26 21:56:19,608 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 21:56:19,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:56:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 21:56:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 21:56:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 21:56:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 21:56:19,614 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 21:56:19,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:56:19,614 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 21:56:19,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 21:56:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 21:56:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 21:56:19,614 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:56:19,615 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-09-26 21:56:19,615 INFO L423 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:56:19,615 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:56:19,615 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-09-26 21:56:19,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:56:19,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:56:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:19,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:56:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:21,414 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:21,415 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-09-26 21:56:21,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:56:21,449 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-09-26 21:56:21,449 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:56:21,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:21,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:21,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-09-26 21:56:21,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 21:56:21,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 21:56:21,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:21,697 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-09-26 21:56:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:56:25,675 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 21:56:25,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 21:56:25,676 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-09-26 21:56:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:56:25,676 INFO L225 Difference]: With dead ends: 38 [2018-09-26 21:56:25,676 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 21:56:25,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:56:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 21:56:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 21:56:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 21:56:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 21:56:25,680 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 21:56:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:56:25,681 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 21:56:25,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 21:56:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 21:56:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 21:56:25,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:56:25,681 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-09-26 21:56:25,681 INFO L423 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:56:25,681 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:56:25,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-09-26 21:56:25,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:56:25,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:56:25,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:25,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:56:25,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:26,956 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:26,956 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:56:26,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:56:26,985 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:56:26,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:56:26,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:27,224 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:27,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-09-26 21:56:27,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 21:56:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 21:56:27,225 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:27,225 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-09-26 21:56:31,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:56:31,455 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 21:56:31,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 21:56:31,456 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-09-26 21:56:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:56:31,457 INFO L225 Difference]: With dead ends: 39 [2018-09-26 21:56:31,457 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 21:56:31,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:56:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 21:56:31,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 21:56:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 21:56:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 21:56:31,460 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 21:56:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:56:31,460 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 21:56:31,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 21:56:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 21:56:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 21:56:31,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:56:31,461 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-09-26 21:56:31,461 INFO L423 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:56:31,461 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:56:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-09-26 21:56:31,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:56:31,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:56:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:31,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:56:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:32,770 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:32,770 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-09-26 21:56:32,777 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:56:32,794 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-09-26 21:56:32,795 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:56:32,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:32,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:32,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-09-26 21:56:32,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 21:56:32,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 21:56:32,940 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:32,940 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-09-26 21:56:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:56:37,235 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 21:56:37,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 21:56:37,235 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-09-26 21:56:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:56:37,236 INFO L225 Difference]: With dead ends: 40 [2018-09-26 21:56:37,236 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 21:56:37,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:56:37,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 21:56:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 21:56:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 21:56:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 21:56:37,241 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 21:56:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:56:37,241 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 21:56:37,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 21:56:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 21:56:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 21:56:37,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:56:37,242 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-09-26 21:56:37,242 INFO L423 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:56:37,242 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:56:37,242 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-09-26 21:56:37,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:56:37,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:56:37,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:37,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:56:37,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:38,608 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:38,608 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-09-26 21:56:38,617 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:56:38,639 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-26 21:56:38,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:56:38,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:38,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:38,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-09-26 21:56:38,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 21:56:38,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 21:56:38,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:38,789 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-09-26 21:56:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:56:43,438 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 21:56:43,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 21:56:43,439 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-09-26 21:56:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:56:43,440 INFO L225 Difference]: With dead ends: 41 [2018-09-26 21:56:43,440 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 21:56:43,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:56:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 21:56:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 21:56:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 21:56:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 21:56:43,444 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 21:56:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:56:43,444 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 21:56:43,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 21:56:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 21:56:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 21:56:43,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:56:43,445 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-09-26 21:56:43,445 INFO L423 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:56:43,446 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:56:43,446 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-09-26 21:56:43,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:56:43,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:56:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:43,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:56:43,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:45,236 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:45,236 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-09-26 21:56:45,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:56:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:45,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:45,380 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:45,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-09-26 21:56:45,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 21:56:45,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 21:56:45,381 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:45,381 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-09-26 21:56:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:56:50,236 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 21:56:50,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 21:56:50,236 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-09-26 21:56:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:56:50,237 INFO L225 Difference]: With dead ends: 42 [2018-09-26 21:56:50,237 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 21:56:50,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:56:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 21:56:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 21:56:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 21:56:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 21:56:50,242 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 21:56:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:56:50,242 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 21:56:50,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 21:56:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 21:56:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 21:56:50,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:56:50,243 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-09-26 21:56:50,243 INFO L423 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:56:50,243 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:56:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-09-26 21:56:50,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:56:50,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:56:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:50,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:56:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:51,711 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:51,712 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:56:51,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:56:51,731 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:56:51,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:56:51,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:51,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:51,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-09-26 21:56:51,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 21:56:51,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 21:56:51,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:51,869 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-09-26 21:56:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:56:57,077 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 21:56:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 21:56:57,078 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-09-26 21:56:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:56:57,079 INFO L225 Difference]: With dead ends: 43 [2018-09-26 21:56:57,079 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 21:56:57,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:56:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 21:56:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 21:56:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 21:56:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 21:56:57,083 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 21:56:57,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:56:57,083 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 21:56:57,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 21:56:57,083 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 21:56:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 21:56:57,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:56:57,083 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-09-26 21:56:57,084 INFO L423 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:56:57,084 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:56:57,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-09-26 21:56:57,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:56:57,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:56:57,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:57,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:56:57,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:56:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:56:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:58,806 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:56:58,806 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-09-26 21:56:58,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:56:58,835 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-09-26 21:56:58,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:56:58,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:56:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:56:58,955 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:56:58,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-09-26 21:56:58,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 21:56:58,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 21:56:58,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:56:58,955 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-09-26 21:57:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:57:04,341 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 21:57:04,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 21:57:04,341 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-09-26 21:57:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:57:04,342 INFO L225 Difference]: With dead ends: 44 [2018-09-26 21:57:04,342 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 21:57:04,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:57:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 21:57:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 21:57:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 21:57:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 21:57:04,346 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 21:57:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:57:04,347 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 21:57:04,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 21:57:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 21:57:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 21:57:04,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:57:04,347 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-09-26 21:57:04,347 INFO L423 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:57:04,348 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:57:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-09-26 21:57:04,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:57:04,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:57:04,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:04,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:57:04,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:57:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:06,051 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:57:06,051 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-09-26 21:57:06,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:57:06,071 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:57:06,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:57:06,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:57:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:06,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:57:06,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-09-26 21:57:06,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 21:57:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 21:57:06,217 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:57:06,217 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-09-26 21:57:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:57:11,889 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 21:57:11,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:57:11,890 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-09-26 21:57:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:57:11,891 INFO L225 Difference]: With dead ends: 45 [2018-09-26 21:57:11,891 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 21:57:11,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:57:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 21:57:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 21:57:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 21:57:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 21:57:11,894 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 21:57:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:57:11,895 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 21:57:11,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 21:57:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 21:57:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 21:57:11,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:57:11,895 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-09-26 21:57:11,895 INFO L423 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:57:11,896 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:57:11,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-09-26 21:57:11,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:57:11,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:57:11,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:11,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:57:11,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:57:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:14,993 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:57:14,993 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-09-26 21:57:15,000 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:57:15,020 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-09-26 21:57:15,020 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:57:15,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:57:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:15,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:57:15,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-09-26 21:57:15,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 21:57:15,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 21:57:15,157 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:57:15,157 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-09-26 21:57:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:57:21,035 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 21:57:21,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 21:57:21,036 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-09-26 21:57:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:57:21,037 INFO L225 Difference]: With dead ends: 46 [2018-09-26 21:57:21,037 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 21:57:21,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:57:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 21:57:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 21:57:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 21:57:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 21:57:21,040 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 21:57:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:57:21,041 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 21:57:21,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 21:57:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 21:57:21,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 21:57:21,041 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:57:21,042 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-09-26 21:57:21,042 INFO L423 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:57:21,042 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:57:21,042 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-09-26 21:57:21,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:57:21,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:57:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:21,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:57:21,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:57:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:22,929 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:57:22,929 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-09-26 21:57:22,937 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:57:22,979 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-09-26 21:57:22,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:57:22,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:57:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:23,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:57:23,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-09-26 21:57:23,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 21:57:23,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 21:57:23,132 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:57:23,132 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-09-26 21:57:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:57:29,540 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 21:57:29,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 21:57:29,541 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-09-26 21:57:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:57:29,541 INFO L225 Difference]: With dead ends: 47 [2018-09-26 21:57:29,542 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 21:57:29,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:57:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 21:57:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 21:57:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 21:57:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 21:57:29,546 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 21:57:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:57:29,546 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 21:57:29,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 21:57:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 21:57:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 21:57:29,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:57:29,547 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-09-26 21:57:29,547 INFO L423 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:57:29,547 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:57:29,547 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-09-26 21:57:29,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:57:29,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:57:29,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:29,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:57:29,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:57:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:31,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:57:31,402 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-09-26 21:57:31,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:57:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:57:31,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:57:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:31,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:57:31,565 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-09-26 21:57:31,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 21:57:31,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 21:57:31,565 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:57:31,565 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-09-26 21:57:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:57:38,041 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 21:57:38,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 21:57:38,042 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-09-26 21:57:38,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:57:38,043 INFO L225 Difference]: With dead ends: 48 [2018-09-26 21:57:38,043 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 21:57:38,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:57:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 21:57:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 21:57:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 21:57:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 21:57:38,048 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 21:57:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:57:38,048 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 21:57:38,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 21:57:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 21:57:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 21:57:38,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:57:38,049 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-09-26 21:57:38,049 INFO L423 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:57:38,049 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:57:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-09-26 21:57:38,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:57:38,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:57:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:38,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:57:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:57:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:40,142 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:57:40,142 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-09-26 21:57:40,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:57:40,163 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:57:40,164 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:57:40,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:57:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:40,318 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:57:40,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-09-26 21:57:40,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 21:57:40,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 21:57:40,319 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:57:40,319 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-09-26 21:57:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:57:47,167 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 21:57:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 21:57:47,168 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-09-26 21:57:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:57:47,169 INFO L225 Difference]: With dead ends: 49 [2018-09-26 21:57:47,169 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 21:57:47,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:57:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 21:57:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 21:57:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 21:57:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 21:57:47,173 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 21:57:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:57:47,173 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 21:57:47,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 21:57:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 21:57:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 21:57:47,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:57:47,174 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-09-26 21:57:47,174 INFO L423 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:57:47,174 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:57:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-09-26 21:57:47,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:57:47,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:57:47,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:47,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:57:47,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:57:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:49,274 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:57:49,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:57:49,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:57:49,305 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-09-26 21:57:49,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:57:49,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:57:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:49,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:57:49,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-09-26 21:57:49,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 21:57:49,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 21:57:49,461 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:57:49,461 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-09-26 21:57:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:57:56,794 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 21:57:56,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 21:57:56,794 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-09-26 21:57:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:57:56,795 INFO L225 Difference]: With dead ends: 50 [2018-09-26 21:57:56,795 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 21:57:56,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:57:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 21:57:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 21:57:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 21:57:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 21:57:56,799 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 21:57:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:57:56,800 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 21:57:56,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 21:57:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 21:57:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 21:57:56,800 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:57:56,800 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-09-26 21:57:56,801 INFO L423 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:57:56,801 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:57:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-09-26 21:57:56,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:57:56,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:57:56,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:56,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:57:56,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:57:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:57:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:58,977 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:57:58,977 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-09-26 21:57:58,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:57:59,001 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:57:59,001 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:57:59,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:57:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:57:59,158 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:57:59,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-09-26 21:57:59,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 21:57:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 21:57:59,159 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:57:59,159 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-09-26 21:58:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:58:06,777 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 21:58:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 21:58:06,777 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-09-26 21:58:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:58:06,778 INFO L225 Difference]: With dead ends: 51 [2018-09-26 21:58:06,778 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 21:58:06,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:58:06,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 21:58:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 21:58:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 21:58:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 21:58:06,782 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 21:58:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:58:06,782 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 21:58:06,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 21:58:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 21:58:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 21:58:06,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:58:06,782 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-09-26 21:58:06,783 INFO L423 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:58:06,783 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:58:06,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-09-26 21:58:06,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:58:06,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:58:06,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:58:06,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:58:06,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:58:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:58:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:58:09,163 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:58:09,163 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:58:09,170 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:58:09,192 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-26 21:58:09,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:58:09,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:58:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:58:09,401 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:58:09,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-09-26 21:58:09,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 21:58:09,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 21:58:09,402 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:58:09,402 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-09-26 21:58:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:58:17,347 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 21:58:17,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 21:58:17,348 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-09-26 21:58:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:58:17,349 INFO L225 Difference]: With dead ends: 52 [2018-09-26 21:58:17,349 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 21:58:17,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:58:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 21:58:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 21:58:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 21:58:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 21:58:17,352 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 21:58:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:58:17,353 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 21:58:17,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 21:58:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 21:58:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 21:58:17,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:58:17,354 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-09-26 21:58:17,354 INFO L423 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:58:17,354 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:58:17,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-09-26 21:58:17,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:58:17,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:58:17,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:58:17,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:58:17,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:58:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:58:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:58:19,871 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:58:19,871 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-09-26 21:58:19,879 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:58:19,903 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-26 21:58:19,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:58:19,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:58:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:58:20,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:58:20,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-09-26 21:58:20,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 21:58:20,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 21:58:20,070 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:58:20,070 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-09-26 21:58:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:58:28,204 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 21:58:28,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 21:58:28,205 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-09-26 21:58:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:58:28,206 INFO L225 Difference]: With dead ends: 53 [2018-09-26 21:58:28,206 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 21:58:28,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:58:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 21:58:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 21:58:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 21:58:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 21:58:28,211 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 21:58:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:58:28,212 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 21:58:28,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 21:58:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 21:58:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 21:58:28,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:58:28,212 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-09-26 21:58:28,213 INFO L423 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:58:28,213 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:58:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-09-26 21:58:28,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:58:28,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:58:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:58:28,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:58:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:58:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:58:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:58:30,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:58:30,827 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-09-26 21:58:30,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:58:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:58:30,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:58:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:58:30,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:58:30,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-09-26 21:58:30,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 21:58:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 21:58:30,993 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:58:30,993 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-09-26 21:58:39,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:58:39,287 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 21:58:39,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 21:58:39,288 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-09-26 21:58:39,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:58:39,288 INFO L225 Difference]: With dead ends: 54 [2018-09-26 21:58:39,289 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 21:58:39,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:58:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 21:58:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 21:58:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 21:58:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 21:58:39,293 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 21:58:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:58:39,293 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 21:58:39,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 21:58:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 21:58:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 21:58:39,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:58:39,294 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-09-26 21:58:39,294 INFO L423 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:58:39,294 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:58:39,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-09-26 21:58:39,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:58:39,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:58:39,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:58:39,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:58:39,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:58:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:58:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:58:42,538 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:58:42,538 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-09-26 21:58:42,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:58:42,563 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:58:42,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:58:42,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:58:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:58:42,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:58:42,715 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-09-26 21:58:42,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 21:58:42,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 21:58:42,715 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:58:42,715 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-09-26 21:58:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:58:51,444 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 21:58:51,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 21:58:51,444 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-09-26 21:58:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:58:51,445 INFO L225 Difference]: With dead ends: 55 [2018-09-26 21:58:51,445 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 21:58:51,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:58:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 21:58:51,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 21:58:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 21:58:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 21:58:51,449 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 21:58:51,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:58:51,449 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 21:58:51,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 21:58:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 21:58:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 21:58:51,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:58:51,450 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-09-26 21:58:51,450 INFO L423 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:58:51,450 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:58:51,450 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-09-26 21:58:51,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:58:51,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:58:51,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:58:51,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:58:51,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:58:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:58:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:58:54,302 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:58:54,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 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-09-26 21:58:54,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:58:54,337 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-09-26 21:58:54,337 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:58:54,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:58:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:58:54,522 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:58:54,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-09-26 21:58:54,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 21:58:54,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 21:58:54,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:58:54,523 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-09-26 21:59:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:59:03,661 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 21:59:03,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 21:59:03,661 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-09-26 21:59:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:59:03,662 INFO L225 Difference]: With dead ends: 56 [2018-09-26 21:59:03,662 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 21:59:03,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:59:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 21:59:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 21:59:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 21:59:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 21:59:03,666 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 21:59:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:59:03,666 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 21:59:03,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 21:59:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 21:59:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 21:59:03,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:59:03,667 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-09-26 21:59:03,667 INFO L423 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:59:03,667 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:59:03,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-09-26 21:59:03,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:59:03,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:59:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:59:03,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:59:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:59:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:59:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:59:06,673 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:59:06,673 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:59:06,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:59:06,701 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:59:06,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:59:06,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:59:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:59:06,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:59:06,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-09-26 21:59:06,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 21:59:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 21:59:06,859 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:59:06,859 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. Received shutdown request... [2018-09-26 21:59:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 21:59:16,064 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:59:16,070 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:59:16,071 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:59:16 BoogieIcfgContainer [2018-09-26 21:59:16,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:59:16,071 INFO L168 Benchmark]: Toolchain (without parser) took 249633.04 ms. Allocated memory was 1.6 GB in the beginning and 1.2 GB in the end (delta: -317.2 MB). Free memory was 1.5 GB in the beginning and 975.8 MB in the end (delta: 510.3 MB). Peak memory consumption was 193.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:59:16,073 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:59:16,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.44 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:59:16,074 INFO L168 Benchmark]: Boogie Preprocessor took 21.80 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:59:16,075 INFO L168 Benchmark]: RCFGBuilder took 212.16 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:59:16,075 INFO L168 Benchmark]: TraceAbstraction took 249351.85 ms. Allocated memory was 1.6 GB in the beginning and 1.2 GB in the end (delta: -317.2 MB). Free memory was 1.5 GB in the beginning and 975.8 MB in the end (delta: 489.1 MB). Peak memory consumption was 171.9 MB. Max. memory is 7.1 GB. [2018-09-26 21:59:16,079 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.30 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.44 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.80 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 212.16 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249351.85 ms. Allocated memory was 1.6 GB in the beginning and 1.2 GB in the end (delta: -317.2 MB). Free memory was 1.5 GB in the beginning and 975.8 MB in the end (delta: 489.1 MB). Peak memory consumption was 171.9 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 (55states) and FLOYD_HOARE automaton (currently 55 states, 55 states before enhancement), while ReachableStatesComputation was computing reachable states (54 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 249.2s OverallTime, 53 OverallIterations, 52 TraceHistogramMax, 180.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 53850 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2861 GetRequests, 1378 SyntacticMatches, 52 SemanticMatches, 1431 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=52, 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, 52 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 65.0s InterpolantComputationTime, 2966 NumberOfCodeBlocks, 2966 NumberOfCodeBlocksAsserted, 456 NumberOfCheckSat, 2861 ConstructedInterpolants, 0 QuantifiedInterpolants, 714539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3016 ConjunctsInSsa, 2912 ConjunctsInUnsatCore, 105 InterpolantComputations, 1 PerfectInterpolantSequences, 0/49608 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-09-26_21-59-16-090.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-09-26_21-59-16-090.csv Completed graceful shutdown