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-00a8621 [2018-09-30 10:57:10,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:57:10,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:57:10,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:57:10,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:57:10,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:57:10,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:57:10,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:57:10,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:57:10,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:57:10,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:57:10,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:57:10,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:57:10,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:57:10,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:57:10,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:57:10,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:57:10,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:57:10,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:57:10,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:57:10,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:57:10,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:57:10,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:57:10,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:57:10,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:57:10,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:57:10,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:57:10,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:57:10,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:57:10,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:57:10,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:57:10,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:57:10,308 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:57:10,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:57:10,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:57:10,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:57:10,310 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-30 10:57:10,336 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:57:10,338 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:57:10,339 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:57:10,339 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:57:10,340 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:57:10,340 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:57:10,340 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:57:10,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:57:10,341 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:57:10,341 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:57:10,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:57:10,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:57:10,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:57:10,342 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:57:10,342 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:57:10,342 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:57:10,342 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:57:10,344 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:57:10,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:57:10,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:57:10,345 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:57:10,345 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:57:10,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:57:10,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:57:10,346 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:57:10,346 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:57:10,346 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:57:10,346 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:57:10,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:57:10,346 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:57:10,347 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:57:10,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:57:10,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:57:10,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:57:10,420 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:57:10,421 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:57:10,421 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-30 10:57:10,422 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl' [2018-09-30 10:57:10,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:57:10,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:57:10,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:57:10,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:57:10,470 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:57:10,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (1/1) ... [2018-09-30 10:57:10,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (1/1) ... [2018-09-30 10:57:10,508 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:57:10,508 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:57:10,508 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:57:10,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:57:10,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:57:10,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:57:10,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:57:10,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (1/1) ... [2018-09-30 10:57:10,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (1/1) ... [2018-09-30 10:57:10,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (1/1) ... [2018-09-30 10:57:10,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (1/1) ... [2018-09-30 10:57:10,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (1/1) ... [2018-09-30 10:57:10,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (1/1) ... [2018-09-30 10:57:10,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (1/1) ... [2018-09-30 10:57:10,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:57:10,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:57:10,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:57:10,536 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:57:10,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (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-30 10:57:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-09-30 10:57:10,610 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-09-30 10:57:10,784 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:57:10,785 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:57:10 BoogieIcfgContainer [2018-09-30 10:57:10,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:57:10,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:57:10,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:57:10,789 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:57:10,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:10" (1/2) ... [2018-09-30 10:57:10,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354b26ab and model type DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:57:10, skipping insertion in model container [2018-09-30 10:57:10,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:57:10" (2/2) ... [2018-09-30 10:57:10,793 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-09-30 10:57:10,802 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:57:10,809 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:57:10,853 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:57:10,854 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:57:10,854 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:57:10,854 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:57:10,855 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:57:10,855 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:57:10,855 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:57:10,855 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:57:10,855 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:57:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-30 10:57:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-30 10:57:10,875 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:10,876 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-30 10:57:10,877 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:10,885 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-09-30 10:57:10,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:10,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:10,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:10,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:10,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:11,053 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-30 10:57:11,055 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:57:11,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-30 10:57:11,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:57:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:57:11,074 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:11,077 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-30 10:57:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:11,268 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-30 10:57:11,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:57:11,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-30 10:57:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:11,281 INFO L225 Difference]: With dead ends: 9 [2018-09-30 10:57:11,281 INFO L226 Difference]: Without dead ends: 4 [2018-09-30 10:57:11,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-09-30 10:57:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-09-30 10:57:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-09-30 10:57:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-09-30 10:57:11,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-09-30 10:57:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:11,313 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-09-30 10:57:11,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:57:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-09-30 10:57:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 10:57:11,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:11,314 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-30 10:57:11,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:11,314 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:11,315 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-09-30 10:57:11,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:11,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:11,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:11,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:11,411 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-30 10:57:11,411 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:11,411 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-30 10:57:11,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:11,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:11,509 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-30 10:57:11,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:11,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-09-30 10:57:11,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:57:11,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:57:11,545 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:11,545 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-09-30 10:57:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:11,850 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-09-30 10:57:11,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:57:11,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-30 10:57:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:11,851 INFO L225 Difference]: With dead ends: 6 [2018-09-30 10:57:11,852 INFO L226 Difference]: Without dead ends: 5 [2018-09-30 10:57:11,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-30 10:57:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-30 10:57:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-30 10:57:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-30 10:57:11,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-30 10:57:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:11,857 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-30 10:57:11,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:57:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-30 10:57:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:57:11,858 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:11,858 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-09-30 10:57:11,858 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:11,858 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:11,859 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-09-30 10:57:11,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:11,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:11,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:11,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:11,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:11,945 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-30 10:57:11,946 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:11,946 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-30 10:57:11,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:11,970 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:11,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:11,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:12,024 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-30 10:57:12,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:12,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-30 10:57:12,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:57:12,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:57:12,046 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:12,046 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-09-30 10:57:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:12,415 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-30 10:57:12,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:57:12,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-30 10:57:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:12,417 INFO L225 Difference]: With dead ends: 7 [2018-09-30 10:57:12,418 INFO L226 Difference]: Without dead ends: 6 [2018-09-30 10:57:12,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-30 10:57:12,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-30 10:57:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-30 10:57:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-30 10:57:12,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-30 10:57:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:12,422 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-30 10:57:12,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:57:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-30 10:57:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:57:12,423 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:12,423 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-09-30 10:57:12,424 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:12,424 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:12,424 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-09-30 10:57:12,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:12,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:12,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:12,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:12,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:12,506 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-30 10:57:12,507 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:12,507 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-30 10:57:12,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:12,526 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 10:57:12,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:12,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:12,561 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-30 10:57:12,581 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:12,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:57:12,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:57:12,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:57:12,582 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:12,582 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-09-30 10:57:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:12,883 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-30 10:57:12,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:57:12,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-30 10:57:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:12,885 INFO L225 Difference]: With dead ends: 8 [2018-09-30 10:57:12,886 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 10:57:12,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 10:57:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-30 10:57:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 10:57:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 10:57:12,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-30 10:57:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:12,889 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-30 10:57:12,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:57:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 10:57:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 10:57:12,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:12,890 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-09-30 10:57:12,891 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:12,891 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-09-30 10:57:12,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:12,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:12,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:12,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:12,982 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-30 10:57:12,982 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:12,983 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-30 10:57:12,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:12,996 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:12,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:12,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:13,039 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-30 10:57:13,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:13,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 10:57:13,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:57:13,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:57:13,060 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:13,061 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-09-30 10:57:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:13,687 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-30 10:57:13,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:57:13,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-30 10:57:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:13,688 INFO L225 Difference]: With dead ends: 9 [2018-09-30 10:57:13,688 INFO L226 Difference]: Without dead ends: 8 [2018-09-30 10:57:13,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-30 10:57:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-30 10:57:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 10:57:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-30 10:57:13,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-30 10:57:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:13,693 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-30 10:57:13,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:57:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-30 10:57:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:57:13,694 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:13,694 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-09-30 10:57:13,694 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:13,694 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:13,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-09-30 10:57:13,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:13,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:13,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:13,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:13,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:13,818 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-30 10:57:13,819 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:13,819 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-30 10:57:13,829 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:13,858 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-30 10:57:13,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:13,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:13,892 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-30 10:57:13,912 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:13,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:57:13,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:57:13,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:57:13,914 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:13,914 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-09-30 10:57:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:14,148 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-30 10:57:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:57:14,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-30 10:57:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:14,149 INFO L225 Difference]: With dead ends: 10 [2018-09-30 10:57:14,149 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 10:57:14,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 10:57:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 10:57:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 10:57:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 10:57:14,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-30 10:57:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:14,153 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 10:57:14,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:57:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 10:57:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:57:14,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:14,154 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-09-30 10:57:14,154 INFO L423 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:14,154 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:14,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-09-30 10:57:14,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:14,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:14,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:14,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:14,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:14,289 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-30 10:57:14,289 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:14,289 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-30 10:57:14,300 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:14,309 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-09-30 10:57:14,310 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:14,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:14,334 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-30 10:57:14,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:14,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:57:14,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:57:14,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:57:14,355 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:14,355 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-09-30 10:57:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:14,644 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-30 10:57:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:57:14,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-09-30 10:57:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:14,645 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:57:14,645 INFO L226 Difference]: Without dead ends: 10 [2018-09-30 10:57:14,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-30 10:57:14,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-30 10:57:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-30 10:57:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-30 10:57:14,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-30 10:57:14,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:14,650 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-30 10:57:14,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:57:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-30 10:57:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:57:14,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:14,651 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-09-30 10:57:14,652 INFO L423 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:14,652 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:14,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-09-30 10:57:14,652 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:14,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:14,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:14,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:14,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:14,778 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-30 10:57:14,779 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:14,779 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-30 10:57:14,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:14,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:14,905 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-30 10:57:14,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:14,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-30 10:57:14,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:57:14,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:57:14,926 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:14,926 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-09-30 10:57:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:15,263 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-30 10:57:15,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:57:15,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-09-30 10:57:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:15,265 INFO L225 Difference]: With dead ends: 12 [2018-09-30 10:57:15,265 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 10:57:15,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 10:57:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 10:57:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 10:57:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 10:57:15,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-30 10:57:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:15,270 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-30 10:57:15,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:57:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 10:57:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:57:15,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:15,270 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-09-30 10:57:15,271 INFO L423 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:15,271 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-09-30 10:57:15,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:15,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:15,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:15,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:15,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:15,416 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-30 10:57:15,417 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:15,417 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:57:15,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:15,430 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:15,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:15,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:15,478 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-30 10:57:15,498 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:15,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-09-30 10:57:15,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:57:15,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:57:15,499 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:15,499 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-09-30 10:57:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:16,040 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-30 10:57:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:57:16,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-09-30 10:57:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:16,041 INFO L225 Difference]: With dead ends: 13 [2018-09-30 10:57:16,042 INFO L226 Difference]: Without dead ends: 12 [2018-09-30 10:57:16,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-30 10:57:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-30 10:57:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 10:57:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-30 10:57:16,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-30 10:57:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:16,047 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-30 10:57:16,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:57:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-30 10:57:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:57:16,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:16,048 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-09-30 10:57:16,048 INFO L423 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:16,049 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-09-30 10:57:16,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:16,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:16,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:16,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:16,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:16,185 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-30 10:57:16,185 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:16,186 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-30 10:57:16,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:16,202 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-30 10:57:16,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:16,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:16,244 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-30 10:57:16,265 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:16,265 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-09-30 10:57:16,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:57:16,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:57:16,266 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:16,266 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-09-30 10:57:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:16,906 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-30 10:57:16,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:57:16,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-30 10:57:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:16,908 INFO L225 Difference]: With dead ends: 14 [2018-09-30 10:57:16,908 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 10:57:16,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 10:57:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 10:57:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 10:57:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-30 10:57:16,912 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-30 10:57:16,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:16,913 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-30 10:57:16,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:57:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-30 10:57:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:57:16,914 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:16,914 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-09-30 10:57:16,914 INFO L423 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:16,914 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:16,914 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-09-30 10:57:16,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:16,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:16,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:16,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:16,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:17,144 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-30 10:57:17,144 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:17,145 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-30 10:57:17,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:17,171 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:17,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:17,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:17,213 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-30 10:57:17,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:17,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-09-30 10:57:17,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:57:17,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:57:17,234 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:17,234 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-09-30 10:57:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:17,931 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-30 10:57:17,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:57:17,931 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-30 10:57:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:17,932 INFO L225 Difference]: With dead ends: 15 [2018-09-30 10:57:17,932 INFO L226 Difference]: Without dead ends: 14 [2018-09-30 10:57:17,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-30 10:57:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-30 10:57:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-30 10:57:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-30 10:57:17,936 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-30 10:57:17,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:17,936 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-30 10:57:17,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:57:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-30 10:57:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:57:17,937 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:17,937 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-09-30 10:57:17,938 INFO L423 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:17,938 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:17,938 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-09-30 10:57:17,938 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:17,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:17,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:18,129 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-30 10:57:18,129 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:18,130 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:57:18,143 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:18,155 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-30 10:57:18,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:18,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:18,201 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-30 10:57:18,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:18,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-09-30 10:57:18,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:57:18,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:57:18,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:18,224 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-09-30 10:57:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:18,825 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-30 10:57:18,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:57:18,825 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 10:57:18,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:18,826 INFO L225 Difference]: With dead ends: 16 [2018-09-30 10:57:18,827 INFO L226 Difference]: Without dead ends: 15 [2018-09-30 10:57:18,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-30 10:57:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-30 10:57:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-30 10:57:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-30 10:57:18,830 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-30 10:57:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:18,831 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-30 10:57:18,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:57:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-30 10:57:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:57:18,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:18,831 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-09-30 10:57:18,832 INFO L423 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:18,832 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-09-30 10:57:18,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:18,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:18,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:19,216 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-30 10:57:19,216 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:19,216 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:57:19,225 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:19,233 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 10:57:19,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:19,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:19,271 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-30 10:57:19,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:19,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-09-30 10:57:19,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:57:19,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:57:19,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:19,294 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-09-30 10:57:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:20,071 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-30 10:57:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:57:20,071 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-09-30 10:57:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:20,072 INFO L225 Difference]: With dead ends: 17 [2018-09-30 10:57:20,072 INFO L226 Difference]: Without dead ends: 16 [2018-09-30 10:57:20,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-30 10:57:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-30 10:57:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-30 10:57:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-30 10:57:20,077 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-30 10:57:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:20,078 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-30 10:57:20,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:57:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-30 10:57:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:57:20,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:20,079 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-09-30 10:57:20,079 INFO L423 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:20,079 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:20,079 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-09-30 10:57:20,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:20,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:20,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:20,312 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-30 10:57:20,313 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:20,313 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:57:20,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:20,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:20,382 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-30 10:57:20,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:20,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-09-30 10:57:20,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:57:20,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:57:20,404 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:20,404 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-09-30 10:57:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:21,316 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-30 10:57:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:57:21,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-30 10:57:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:21,317 INFO L225 Difference]: With dead ends: 18 [2018-09-30 10:57:21,317 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 10:57:21,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 10:57:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-30 10:57:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 10:57:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-30 10:57:21,322 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-30 10:57:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:21,323 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-30 10:57:21,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:57:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-30 10:57:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:57:21,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:21,324 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-09-30 10:57:21,324 INFO L423 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:21,324 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-09-30 10:57:21,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:21,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:21,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:21,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:21,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:21,593 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-30 10:57:21,593 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:21,593 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-30 10:57:21,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:21,608 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:21,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:21,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:21,726 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-30 10:57:21,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:21,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-09-30 10:57:21,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:57:21,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:57:21,748 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:21,748 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-09-30 10:57:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:22,728 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-30 10:57:22,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:57:22,730 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:57:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:22,730 INFO L225 Difference]: With dead ends: 19 [2018-09-30 10:57:22,731 INFO L226 Difference]: Without dead ends: 18 [2018-09-30 10:57:22,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-30 10:57:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-30 10:57:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-30 10:57:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-30 10:57:22,734 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-30 10:57:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:22,735 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-30 10:57:22,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:57:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-30 10:57:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:57:22,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:22,736 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-09-30 10:57:22,736 INFO L423 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:22,736 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-09-30 10:57:22,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:22,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:22,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:22,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:22,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:23,624 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-30 10:57:23,625 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:23,625 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-30 10:57:23,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:23,647 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-09-30 10:57:23,647 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:23,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:23,745 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-30 10:57:23,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:23,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-09-30 10:57:23,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:57:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:57:23,767 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:23,767 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-09-30 10:57:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:24,855 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-30 10:57:24,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:57:24,856 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-09-30 10:57:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:24,857 INFO L225 Difference]: With dead ends: 20 [2018-09-30 10:57:24,857 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 10:57:24,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 10:57:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-30 10:57:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-30 10:57:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-30 10:57:24,862 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-30 10:57:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:24,862 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-30 10:57:24,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:57:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-30 10:57:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:57:24,863 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:24,863 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-09-30 10:57:24,863 INFO L423 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:24,864 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:24,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-09-30 10:57:24,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:24,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:24,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:24,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:24,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:25,352 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-30 10:57:25,353 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:25,353 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-30 10:57:25,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:25,374 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:25,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:25,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:25,423 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-30 10:57:25,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:25,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-09-30 10:57:25,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 10:57:25,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 10:57:25,444 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:25,444 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-09-30 10:57:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:26,470 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-30 10:57:26,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:57:26,470 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-09-30 10:57:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:26,471 INFO L225 Difference]: With dead ends: 21 [2018-09-30 10:57:26,471 INFO L226 Difference]: Without dead ends: 20 [2018-09-30 10:57:26,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-30 10:57:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-30 10:57:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-30 10:57:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-30 10:57:26,476 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-30 10:57:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:26,477 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-30 10:57:26,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 10:57:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-30 10:57:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 10:57:26,477 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:26,478 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-09-30 10:57:26,478 INFO L423 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:26,478 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-09-30 10:57:26,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:26,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:26,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:27,269 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-30 10:57:27,270 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:27,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:57:27,278 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:27,288 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-09-30 10:57:27,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:27,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:27,486 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-30 10:57:27,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:27,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-09-30 10:57:27,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:57:27,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:57:27,508 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:27,509 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-09-30 10:57:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:28,845 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-30 10:57:28,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:57:28,846 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-09-30 10:57:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:28,847 INFO L225 Difference]: With dead ends: 22 [2018-09-30 10:57:28,847 INFO L226 Difference]: Without dead ends: 21 [2018-09-30 10:57:28,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-30 10:57:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-30 10:57:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 10:57:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-30 10:57:28,852 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-30 10:57:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:28,852 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-30 10:57:28,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:57:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-30 10:57:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:57:28,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:28,853 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-09-30 10:57:28,853 INFO L423 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:28,853 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-09-30 10:57:28,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:28,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:28,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:28,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:28,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:29,195 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-30 10:57:29,195 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:29,196 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-30 10:57:29,206 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:29,225 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-09-30 10:57:29,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:29,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:29,284 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-30 10:57:29,305 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:29,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-09-30 10:57:29,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 10:57:29,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 10:57:29,306 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:29,306 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-09-30 10:57:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:30,711 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-30 10:57:30,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:57:30,711 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-09-30 10:57:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:30,712 INFO L225 Difference]: With dead ends: 23 [2018-09-30 10:57:30,713 INFO L226 Difference]: Without dead ends: 22 [2018-09-30 10:57:30,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-30 10:57:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-30 10:57:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-30 10:57:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-30 10:57:30,717 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-30 10:57:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:30,717 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-30 10:57:30,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 10:57:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-30 10:57:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:57:30,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:30,718 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-09-30 10:57:30,718 INFO L423 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:30,718 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:30,719 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-09-30 10:57:30,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:30,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:30,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:30,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:31,053 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-30 10:57:31,053 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:31,053 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-30 10:57:31,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:31,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:31,154 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-30 10:57:31,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:31,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-09-30 10:57:31,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 10:57:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 10:57:31,184 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:31,184 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-09-30 10:57:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:32,583 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-30 10:57:32,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:57:32,584 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-09-30 10:57:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:32,585 INFO L225 Difference]: With dead ends: 24 [2018-09-30 10:57:32,585 INFO L226 Difference]: Without dead ends: 23 [2018-09-30 10:57:32,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-30 10:57:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-30 10:57:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 10:57:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-30 10:57:32,590 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-30 10:57:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:32,590 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-30 10:57:32,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 10:57:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-30 10:57:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:57:32,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:32,591 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-09-30 10:57:32,591 INFO L423 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:32,591 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:32,591 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-09-30 10:57:32,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:32,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:32,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:32,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:33,297 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-30 10:57:33,298 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:33,298 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-30 10:57:33,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:33,317 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:33,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:33,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:33,376 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-30 10:57:33,396 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:33,396 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-09-30 10:57:33,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-30 10:57:33,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-30 10:57:33,397 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:33,397 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-09-30 10:57:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:34,917 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-30 10:57:34,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:57:34,918 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-09-30 10:57:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:34,919 INFO L225 Difference]: With dead ends: 25 [2018-09-30 10:57:34,919 INFO L226 Difference]: Without dead ends: 24 [2018-09-30 10:57:34,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-30 10:57:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-30 10:57:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-30 10:57:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-30 10:57:34,924 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-30 10:57:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:34,924 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-30 10:57:34,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-30 10:57:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-30 10:57:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-30 10:57:34,925 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:34,925 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-09-30 10:57:34,926 INFO L423 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:34,926 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-09-30 10:57:34,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:34,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:34,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:35,401 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-30 10:57:35,401 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:35,401 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:57:35,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:35,424 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-09-30 10:57:35,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:35,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:35,489 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-30 10:57:35,510 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:35,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-09-30 10:57:35,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 10:57:35,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 10:57:35,511 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:35,511 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-09-30 10:57:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:37,327 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-30 10:57:37,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:57:37,330 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-09-30 10:57:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:37,331 INFO L225 Difference]: With dead ends: 26 [2018-09-30 10:57:37,331 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 10:57:37,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 10:57:37,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-30 10:57:37,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 10:57:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-30 10:57:37,336 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-30 10:57:37,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:37,337 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-30 10:57:37,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 10:57:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-30 10:57:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 10:57:37,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:37,338 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-09-30 10:57:37,338 INFO L423 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:37,338 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:37,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-09-30 10:57:37,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:37,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:37,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:37,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:37,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:37,946 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-30 10:57:37,947 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:37,947 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-30 10:57:37,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:37,962 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:37,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:37,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:38,026 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-30 10:57:38,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:38,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-09-30 10:57:38,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-30 10:57:38,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-30 10:57:38,051 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:38,051 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-09-30 10:57:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:40,091 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-30 10:57:40,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:57:40,092 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-09-30 10:57:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:40,092 INFO L225 Difference]: With dead ends: 27 [2018-09-30 10:57:40,093 INFO L226 Difference]: Without dead ends: 26 [2018-09-30 10:57:40,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-30 10:57:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-30 10:57:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-30 10:57:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-30 10:57:40,097 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-30 10:57:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:40,097 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-30 10:57:40,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-30 10:57:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-30 10:57:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 10:57:40,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:40,098 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-09-30 10:57:40,099 INFO L423 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:40,099 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-09-30 10:57:40,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:40,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:40,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:40,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:40,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:40,934 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-30 10:57:40,935 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:40,935 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-30 10:57:40,942 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:40,957 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-09-30 10:57:40,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:40,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:41,011 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-30 10:57:41,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:41,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-09-30 10:57:41,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 10:57:41,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 10:57:41,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:41,034 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-09-30 10:57:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:43,637 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-30 10:57:43,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 10:57:43,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-09-30 10:57:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:43,638 INFO L225 Difference]: With dead ends: 28 [2018-09-30 10:57:43,638 INFO L226 Difference]: Without dead ends: 27 [2018-09-30 10:57:43,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-30 10:57:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-30 10:57:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 10:57:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-30 10:57:43,643 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-30 10:57:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:43,643 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-30 10:57:43,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 10:57:43,644 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-30 10:57:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 10:57:43,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:43,644 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-09-30 10:57:43,645 INFO L423 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:43,645 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:43,645 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-09-30 10:57:43,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:43,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:43,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:43,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:43,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:44,549 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-30 10:57:44,550 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:44,550 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-30 10:57:44,558 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:44,570 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 10:57:44,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:44,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:44,678 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-30 10:57:44,698 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:44,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-09-30 10:57:44,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-30 10:57:44,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-30 10:57:44,699 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:44,699 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-09-30 10:57:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:46,915 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-30 10:57:46,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:57:46,916 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-09-30 10:57:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:46,916 INFO L225 Difference]: With dead ends: 29 [2018-09-30 10:57:46,917 INFO L226 Difference]: Without dead ends: 28 [2018-09-30 10:57:46,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-30 10:57:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-30 10:57:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-30 10:57:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-30 10:57:46,922 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-30 10:57:46,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:46,922 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-30 10:57:46,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-30 10:57:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-30 10:57:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-30 10:57:46,923 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:46,923 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-09-30 10:57:46,924 INFO L423 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:46,924 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-09-30 10:57:46,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:46,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:46,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:46,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:46,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:48,123 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-30 10:57:48,123 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:48,123 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-30 10:57:48,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:48,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:48,260 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-30 10:57:48,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:48,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-09-30 10:57:48,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-30 10:57:48,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-30 10:57:48,283 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:48,283 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-09-30 10:57:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:50,778 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-30 10:57:50,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:57:50,779 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-09-30 10:57:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:50,780 INFO L225 Difference]: With dead ends: 30 [2018-09-30 10:57:50,780 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 10:57:50,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:50,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 10:57:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-30 10:57:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 10:57:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-30 10:57:50,785 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-30 10:57:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:50,785 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-30 10:57:50,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-30 10:57:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-30 10:57:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 10:57:50,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:50,786 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-09-30 10:57:50,786 INFO L423 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:50,786 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:50,787 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-09-30 10:57:50,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:50,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:50,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:50,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:50,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:51,808 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-30 10:57:51,809 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:51,809 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-30 10:57:51,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:51,834 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:51,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:51,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:51,897 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-30 10:57:51,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:51,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-09-30 10:57:51,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-30 10:57:51,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-30 10:57:51,919 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:51,919 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-09-30 10:57:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:54,550 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-30 10:57:54,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:57:54,551 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-09-30 10:57:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:54,552 INFO L225 Difference]: With dead ends: 31 [2018-09-30 10:57:54,552 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 10:57:54,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 10:57:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-30 10:57:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 10:57:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-30 10:57:54,556 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-30 10:57:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:54,556 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-30 10:57:54,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-30 10:57:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-30 10:57:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-30 10:57:54,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:54,557 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-09-30 10:57:54,557 INFO L423 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:54,557 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:54,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-09-30 10:57:54,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:54,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:54,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:55,124 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-30 10:57:55,124 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:55,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 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-30 10:57:55,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:55,171 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-09-30 10:57:55,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:55,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:55,237 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-30 10:57:55,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:55,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-09-30 10:57:55,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 10:57:55,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 10:57:55,259 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:55,259 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-09-30 10:57:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:57,941 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-30 10:57:57,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:57:57,942 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-09-30 10:57:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:57,942 INFO L225 Difference]: With dead ends: 32 [2018-09-30 10:57:57,943 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 10:57:57,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 10:57:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-30 10:57:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 10:57:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-30 10:57:57,948 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-30 10:57:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:57,948 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-30 10:57:57,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 10:57:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-30 10:57:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:57:57,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:57,949 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-09-30 10:57:57,949 INFO L423 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:57,949 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-09-30 10:57:57,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:57,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:57,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:59,384 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-30 10:57:59,385 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:59,385 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-30 10:57:59,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:59,402 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:59,403 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:59,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:59,498 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-30 10:57:59,518 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:59,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-09-30 10:57:59,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-30 10:57:59,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-30 10:57:59,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:59,519 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-09-30 10:58:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:02,360 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-30 10:58:02,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:58:02,360 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-09-30 10:58:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:02,361 INFO L225 Difference]: With dead ends: 33 [2018-09-30 10:58:02,361 INFO L226 Difference]: Without dead ends: 32 [2018-09-30 10:58:02,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-30 10:58:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-30 10:58:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-30 10:58:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-30 10:58:02,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-30 10:58:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:02,367 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-30 10:58:02,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-30 10:58:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-30 10:58:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-30 10:58:02,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:02,368 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-09-30 10:58:02,368 INFO L423 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:02,368 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-09-30 10:58:02,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:02,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:02,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:02,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:02,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:03,286 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-30 10:58:03,287 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:03,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 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-30 10:58:03,301 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:58:03,327 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-09-30 10:58:03,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:03,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:03,405 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-30 10:58:03,427 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:03,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-09-30 10:58:03,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 10:58:03,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 10:58:03,427 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:03,428 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-09-30 10:58:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:06,627 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-30 10:58:06,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:58:06,627 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-09-30 10:58:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:06,628 INFO L225 Difference]: With dead ends: 34 [2018-09-30 10:58:06,628 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 10:58:06,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 10:58:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-30 10:58:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-30 10:58:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-30 10:58:06,633 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-30 10:58:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:06,634 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-30 10:58:06,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 10:58:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-30 10:58:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 10:58:06,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:06,634 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-09-30 10:58:06,635 INFO L423 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:06,635 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-09-30 10:58:06,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:06,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:06,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:06,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:06,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:07,633 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-30 10:58:07,634 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:07,634 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-30 10:58:07,643 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:58:07,661 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-09-30 10:58:07,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:07,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:07,801 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-30 10:58:07,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:07,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-09-30 10:58:07,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-30 10:58:07,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-30 10:58:07,835 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:07,835 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-09-30 10:58:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:11,560 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-30 10:58:11,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 10:58:11,560 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-09-30 10:58:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:11,561 INFO L225 Difference]: With dead ends: 35 [2018-09-30 10:58:11,561 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 10:58:11,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 10:58:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-30 10:58:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 10:58:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-30 10:58:11,567 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-30 10:58:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:11,568 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-30 10:58:11,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-30 10:58:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-30 10:58:11,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-30 10:58:11,568 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:11,569 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-09-30 10:58:11,569 INFO L423 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:11,569 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:11,569 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-09-30 10:58:11,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:11,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:11,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:11,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:11,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:12,940 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-30 10:58:12,941 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:12,941 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:58:12,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:12,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:13,069 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-30 10:58:13,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:13,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-09-30 10:58:13,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 10:58:13,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 10:58:13,091 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:13,091 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-09-30 10:58:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:16,966 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-30 10:58:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 10:58:16,966 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-09-30 10:58:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:16,967 INFO L225 Difference]: With dead ends: 36 [2018-09-30 10:58:16,967 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 10:58:16,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 10:58:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-30 10:58:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 10:58:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-30 10:58:16,972 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-30 10:58:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:16,973 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-30 10:58:16,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 10:58:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-30 10:58:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:58:16,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:16,973 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-09-30 10:58:16,974 INFO L423 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:16,974 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-09-30 10:58:16,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:16,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:16,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:16,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:16,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:17,978 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-30 10:58:17,978 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:17,978 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-30 10:58:17,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:58:17,997 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:58:17,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:17,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:18,107 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-30 10:58:18,127 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:18,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-09-30 10:58:18,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 10:58:18,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 10:58:18,128 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:18,128 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-09-30 10:58:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:21,872 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-30 10:58:21,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 10:58:21,873 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-09-30 10:58:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:21,874 INFO L225 Difference]: With dead ends: 37 [2018-09-30 10:58:21,874 INFO L226 Difference]: Without dead ends: 36 [2018-09-30 10:58:21,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-30 10:58:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-30 10:58:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-30 10:58:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-30 10:58:21,878 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-30 10:58:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:21,878 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-30 10:58:21,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 10:58:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-30 10:58:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-30 10:58:21,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:21,879 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-09-30 10:58:21,879 INFO L423 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:21,879 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:21,879 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-09-30 10:58:21,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:21,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:21,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:21,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:21,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:23,079 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-30 10:58:23,080 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:23,080 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-30 10:58:23,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:58:23,106 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-09-30 10:58:23,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:23,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:23,285 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-30 10:58:23,306 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:23,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-09-30 10:58:23,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 10:58:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 10:58:23,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:23,307 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-09-30 10:58:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:27,312 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-30 10:58:27,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 10:58:27,312 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-09-30 10:58:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:27,313 INFO L225 Difference]: With dead ends: 38 [2018-09-30 10:58:27,313 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 10:58:27,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 10:58:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-30 10:58:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 10:58:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-30 10:58:27,318 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-30 10:58:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:27,318 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-30 10:58:27,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 10:58:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-30 10:58:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 10:58:27,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:27,319 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-09-30 10:58:27,319 INFO L423 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:27,319 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:27,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-09-30 10:58:27,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:27,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:27,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:27,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:27,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:28,155 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-30 10:58:28,156 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:28,156 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:58:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:58:28,173 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:58:28,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:28,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:28,370 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-30 10:58:28,391 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:28,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-09-30 10:58:28,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-30 10:58:28,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-30 10:58:28,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:28,391 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-09-30 10:58:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:32,593 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-30 10:58:32,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 10:58:32,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-09-30 10:58:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:32,595 INFO L225 Difference]: With dead ends: 39 [2018-09-30 10:58:32,595 INFO L226 Difference]: Without dead ends: 38 [2018-09-30 10:58:32,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-30 10:58:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-30 10:58:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-30 10:58:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-30 10:58:32,599 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-30 10:58:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:32,599 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-30 10:58:32,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-30 10:58:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-30 10:58:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-30 10:58:32,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:32,600 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-09-30 10:58:32,600 INFO L423 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:32,600 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:32,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-09-30 10:58:32,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:32,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:32,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:32,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:32,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:33,520 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-30 10:58:33,521 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:33,521 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-30 10:58:33,528 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:58:33,546 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-09-30 10:58:33,546 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:33,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:33,633 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-30 10:58:33,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:33,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-09-30 10:58:33,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 10:58:33,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 10:58:33,653 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:33,653 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-09-30 10:58:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:38,022 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-30 10:58:38,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 10:58:38,023 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-09-30 10:58:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:38,023 INFO L225 Difference]: With dead ends: 40 [2018-09-30 10:58:38,024 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 10:58:38,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 10:58:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-30 10:58:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-30 10:58:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-30 10:58:38,028 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-30 10:58:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:38,028 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-30 10:58:38,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 10:58:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-30 10:58:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-30 10:58:38,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:38,029 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-09-30 10:58:38,029 INFO L423 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:38,029 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:38,029 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-09-30 10:58:38,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:38,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:38,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:38,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:38,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:38,952 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-30 10:58:38,953 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:38,953 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-30 10:58:38,961 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:58:38,980 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 10:58:38,980 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:38,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:39,074 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-30 10:58:39,094 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:39,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-09-30 10:58:39,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-30 10:58:39,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-30 10:58:39,094 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:39,094 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-09-30 10:58:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:43,755 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-30 10:58:43,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:58:43,756 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-09-30 10:58:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:43,756 INFO L225 Difference]: With dead ends: 41 [2018-09-30 10:58:43,756 INFO L226 Difference]: Without dead ends: 40 [2018-09-30 10:58:43,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-30 10:58:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-30 10:58:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-30 10:58:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-30 10:58:43,760 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-30 10:58:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:43,760 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-30 10:58:43,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-30 10:58:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-30 10:58:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-30 10:58:43,761 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:43,761 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-09-30 10:58:43,761 INFO L423 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:43,761 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:43,761 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-09-30 10:58:43,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:43,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:43,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:43,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:43,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:45,354 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-30 10:58:45,354 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:45,355 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-30 10:58:45,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:45,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:45,452 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-30 10:58:45,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:45,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-09-30 10:58:45,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-30 10:58:45,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-30 10:58:45,472 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:45,473 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-09-30 10:58:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:50,285 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-30 10:58:50,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 10:58:50,285 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-09-30 10:58:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:50,286 INFO L225 Difference]: With dead ends: 42 [2018-09-30 10:58:50,286 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 10:58:50,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 10:58:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-30 10:58:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 10:58:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-30 10:58:50,290 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-30 10:58:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:50,290 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-30 10:58:50,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-30 10:58:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-30 10:58:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 10:58:50,290 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:50,290 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-09-30 10:58:50,290 INFO L423 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:50,291 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:50,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-09-30 10:58:50,291 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:50,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:50,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:50,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:51,320 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-30 10:58:51,321 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:51,321 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:58:51,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:58:51,341 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:58:51,341 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:51,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:51,424 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-30 10:58:51,445 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:51,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-09-30 10:58:51,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-30 10:58:51,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-30 10:58:51,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:51,446 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-09-30 10:58:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:56,616 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-30 10:58:56,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 10:58:56,617 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-09-30 10:58:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:56,618 INFO L225 Difference]: With dead ends: 43 [2018-09-30 10:58:56,618 INFO L226 Difference]: Without dead ends: 42 [2018-09-30 10:58:56,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-30 10:58:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-30 10:58:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-30 10:58:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-30 10:58:56,622 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-30 10:58:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:56,622 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-30 10:58:56,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-30 10:58:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-30 10:58:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 10:58:56,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:56,623 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-09-30 10:58:56,623 INFO L423 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:56,623 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-09-30 10:58:56,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:56,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:56,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:57,761 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-30 10:58:57,761 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:57,761 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-30 10:58:57,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:58:57,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-09-30 10:58:57,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:57,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:57,883 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-30 10:58:57,903 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:57,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-09-30 10:58:57,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 10:58:57,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 10:58:57,904 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:57,904 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-09-30 10:59:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:03,262 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-30 10:59:03,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 10:59:03,263 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-09-30 10:59:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:03,263 INFO L225 Difference]: With dead ends: 44 [2018-09-30 10:59:03,263 INFO L226 Difference]: Without dead ends: 43 [2018-09-30 10:59:03,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-30 10:59:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-30 10:59:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-30 10:59:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-30 10:59:03,267 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-30 10:59:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:03,267 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-30 10:59:03,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 10:59:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-30 10:59:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 10:59:03,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:03,268 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-09-30 10:59:03,268 INFO L423 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:03,268 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:03,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-09-30 10:59:03,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:03,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:03,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:03,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:03,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:04,363 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-30 10:59:04,364 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:04,364 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-30 10:59:04,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:59:04,383 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:59:04,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:04,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:04,475 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-30 10:59:04,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:04,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-09-30 10:59:04,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-30 10:59:04,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-30 10:59:04,495 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:04,496 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-09-30 10:59:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:10,182 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-30 10:59:10,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:59:10,183 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-09-30 10:59:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:10,184 INFO L225 Difference]: With dead ends: 45 [2018-09-30 10:59:10,184 INFO L226 Difference]: Without dead ends: 44 [2018-09-30 10:59:10,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-30 10:59:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-30 10:59:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-30 10:59:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-30 10:59:10,187 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-30 10:59:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:10,187 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-30 10:59:10,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-30 10:59:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-30 10:59:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-30 10:59:10,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:10,188 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-09-30 10:59:10,188 INFO L423 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:10,188 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-09-30 10:59:10,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:10,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:10,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:10,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:10,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:11,486 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-30 10:59:11,486 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:11,486 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-30 10:59:11,497 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:59:11,519 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-09-30 10:59:11,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:11,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:11,610 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-30 10:59:11,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:11,630 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-09-30 10:59:11,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-30 10:59:11,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-30 10:59:11,631 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:11,631 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-09-30 10:59:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:17,552 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-30 10:59:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 10:59:17,552 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-09-30 10:59:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:17,553 INFO L225 Difference]: With dead ends: 46 [2018-09-30 10:59:17,553 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 10:59:17,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 10:59:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-30 10:59:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-30 10:59:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-30 10:59:17,556 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-30 10:59:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:17,556 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-30 10:59:17,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-30 10:59:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-30 10:59:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 10:59:17,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:17,557 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-09-30 10:59:17,557 INFO L423 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:17,557 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-09-30 10:59:17,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:17,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:17,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:18,864 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:18,865 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:59:18,874 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:59:18,896 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-09-30 10:59:18,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:18,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:19,006 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-30 10:59:19,025 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:19,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-09-30 10:59:19,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-30 10:59:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-30 10:59:19,026 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:19,026 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-09-30 10:59:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:25,223 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-30 10:59:25,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 10:59:25,224 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-09-30 10:59:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:25,225 INFO L225 Difference]: With dead ends: 47 [2018-09-30 10:59:25,225 INFO L226 Difference]: Without dead ends: 46 [2018-09-30 10:59:25,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-30 10:59:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-30 10:59:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-30 10:59:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-30 10:59:25,230 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-30 10:59:25,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:25,230 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-30 10:59:25,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-30 10:59:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-30 10:59:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 10:59:25,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:25,231 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-09-30 10:59:25,231 INFO L423 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:25,231 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:25,231 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-09-30 10:59:25,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:25,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:25,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:25,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:25,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:26,885 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-30 10:59:26,885 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:26,885 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-30 10:59:26,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:59:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:26,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:26,995 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-30 10:59:27,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:27,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-09-30 10:59:27,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 10:59:27,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 10:59:27,015 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:27,015 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-09-30 10:59:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:33,512 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-30 10:59:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 10:59:33,512 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-09-30 10:59:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:33,513 INFO L225 Difference]: With dead ends: 48 [2018-09-30 10:59:33,513 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 10:59:33,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 10:59:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-30 10:59:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 10:59:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-30 10:59:33,517 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-30 10:59:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:33,517 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-30 10:59:33,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 10:59:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-30 10:59:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 10:59:33,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:33,518 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-09-30 10:59:33,518 INFO L423 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:33,518 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:33,518 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-09-30 10:59:33,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:33,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:33,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:33,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:59:33,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:34,822 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-30 10:59:34,822 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:34,822 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:59:34,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:59:34,844 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:59:34,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:34,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:34,937 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-30 10:59:34,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:34,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-09-30 10:59:34,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-30 10:59:34,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-30 10:59:34,958 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:34,958 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-09-30 10:59:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:41,877 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-30 10:59:41,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 10:59:41,877 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-09-30 10:59:41,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:41,878 INFO L225 Difference]: With dead ends: 49 [2018-09-30 10:59:41,878 INFO L226 Difference]: Without dead ends: 48 [2018-09-30 10:59:41,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-30 10:59:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-30 10:59:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-30 10:59:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-30 10:59:41,883 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-30 10:59:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:41,883 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-30 10:59:41,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-30 10:59:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-30 10:59:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-30 10:59:41,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:41,884 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-09-30 10:59:41,884 INFO L423 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:41,884 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:41,884 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-09-30 10:59:41,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:41,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:41,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:41,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:41,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:43,335 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-30 10:59:43,335 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:43,335 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:59:43,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:59:43,366 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-09-30 10:59:43,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:43,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:43,467 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-30 10:59:43,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:43,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-09-30 10:59:43,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 10:59:43,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 10:59:43,488 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:43,488 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-09-30 10:59:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:50,555 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-30 10:59:50,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:59:50,555 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-09-30 10:59:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:50,556 INFO L225 Difference]: With dead ends: 50 [2018-09-30 10:59:50,556 INFO L226 Difference]: Without dead ends: 49 [2018-09-30 10:59:50,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-30 10:59:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-30 10:59:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-30 10:59:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-30 10:59:50,561 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-30 10:59:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:50,561 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-30 10:59:50,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 10:59:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-30 10:59:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 10:59:50,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:50,561 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-09-30 10:59:50,562 INFO L423 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:50,562 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-09-30 10:59:50,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:50,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:50,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:50,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:50,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:52,113 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-30 10:59:52,113 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:52,114 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-30 10:59:52,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:59:52,135 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:59:52,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:52,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:52,228 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-30 10:59:52,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:52,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-09-30 10:59:52,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-30 10:59:52,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-30 10:59:52,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:52,248 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-09-30 10:59:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:59,606 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-30 10:59:59,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 10:59:59,606 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-09-30 10:59:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:59,607 INFO L225 Difference]: With dead ends: 51 [2018-09-30 10:59:59,607 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 10:59:59,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 10:59:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-30 10:59:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-30 10:59:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-30 10:59:59,612 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-30 10:59:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:59,612 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-30 10:59:59,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-30 10:59:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-30 10:59:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-30 10:59:59,613 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:59,613 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-09-30 10:59:59,613 INFO L423 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:59,613 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-09-30 10:59:59,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:59,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:59,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:59,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:59,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:00:01,075 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-30 11:00:01,076 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 11:00:01,076 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-30 11:00:01,083 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 11:00:01,105 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-30 11:00:01,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 11:00:01,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 11:00:01,247 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-30 11:00:01,280 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 11:00:01,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-09-30 11:00:01,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 11:00:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 11:00:01,281 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 11:00:01,282 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-09-30 11:00:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 11:00:09,109 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-30 11:00:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 11:00:09,110 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-09-30 11:00:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 11:00:09,111 INFO L225 Difference]: With dead ends: 52 [2018-09-30 11:00:09,111 INFO L226 Difference]: Without dead ends: 51 [2018-09-30 11:00:09,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 11:00:09,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-30 11:00:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-30 11:00:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-30 11:00:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-30 11:00:09,115 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-30 11:00:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 11:00:09,115 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-30 11:00:09,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 11:00:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-30 11:00:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 11:00:09,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 11:00:09,116 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-09-30 11:00:09,116 INFO L423 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 11:00:09,116 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 11:00:09,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-09-30 11:00:09,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 11:00:09,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 11:00:09,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:09,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 11:00:09,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:00:10,688 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-30 11:00:10,688 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 11:00:10,688 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-30 11:00:10,696 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 11:00:10,720 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 11:00:10,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 11:00:10,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 11:00:10,849 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-30 11:00:10,871 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 11:00:10,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-09-30 11:00:10,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-30 11:00:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-30 11:00:10,872 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 11:00:10,872 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-09-30 11:00:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 11:00:19,047 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-30 11:00:19,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 11:00:19,047 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-09-30 11:00:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 11:00:19,048 INFO L225 Difference]: With dead ends: 53 [2018-09-30 11:00:19,048 INFO L226 Difference]: Without dead ends: 52 [2018-09-30 11:00:19,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 11:00:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-30 11:00:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-30 11:00:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 11:00:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-30 11:00:19,054 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-30 11:00:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 11:00:19,054 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-30 11:00:19,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-30 11:00:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-30 11:00:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-30 11:00:19,054 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 11:00:19,055 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-09-30 11:00:19,055 INFO L423 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 11:00:19,055 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 11:00:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-09-30 11:00:19,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 11:00:19,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 11:00:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:19,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 11:00:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:00:20,641 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-30 11:00:20,641 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 11:00:20,641 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 11:00:20,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 11:00:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:00:20,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 11:00:20,755 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-30 11:00:20,775 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 11:00:20,775 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-09-30 11:00:20,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 11:00:20,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 11:00:20,776 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 11:00:20,776 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-09-30 11:00:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 11:00:29,238 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-30 11:00:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 11:00:29,239 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-09-30 11:00:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 11:00:29,240 INFO L225 Difference]: With dead ends: 54 [2018-09-30 11:00:29,240 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 11:00:29,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 11:00:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 11:00:29,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-30 11:00:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 11:00:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-30 11:00:29,245 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-30 11:00:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 11:00:29,245 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-30 11:00:29,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 11:00:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-30 11:00:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 11:00:29,246 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 11:00:29,246 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-09-30 11:00:29,246 INFO L423 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 11:00:29,246 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 11:00:29,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-09-30 11:00:29,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 11:00:29,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 11:00:29,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:29,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 11:00:29,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:00:31,365 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-30 11:00:31,365 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 11:00:31,365 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 11:00:31,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 11:00:31,391 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 11:00:31,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 11:00:31,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 11:00:31,484 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-30 11:00:31,504 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 11:00:31,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-09-30 11:00:31,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-30 11:00:31,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-30 11:00:31,505 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 11:00:31,505 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-09-30 11:00:40,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 11:00:40,209 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-30 11:00:40,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 11:00:40,209 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-09-30 11:00:40,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 11:00:40,210 INFO L225 Difference]: With dead ends: 55 [2018-09-30 11:00:40,210 INFO L226 Difference]: Without dead ends: 54 [2018-09-30 11:00:40,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 11:00:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-30 11:00:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-30 11:00:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-30 11:00:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-30 11:00:40,214 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-30 11:00:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 11:00:40,214 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-30 11:00:40,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-30 11:00:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-30 11:00:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-30 11:00:40,215 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 11:00:40,215 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-09-30 11:00:40,215 INFO L423 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 11:00:40,215 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 11:00:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-09-30 11:00:40,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 11:00:40,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 11:00:40,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:40,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 11:00:40,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:00:43,194 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-30 11:00:43,194 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 11:00:43,194 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-30 11:00:43,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 11:00:43,228 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-09-30 11:00:43,228 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 11:00:43,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 11:00:43,353 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-30 11:00:43,372 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 11:00:43,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-09-30 11:00:43,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-30 11:00:43,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-30 11:00:43,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 11:00:43,374 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-09-30 11:00:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 11:00:52,324 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-30 11:00:52,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 11:00:52,325 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-09-30 11:00:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 11:00:52,326 INFO L225 Difference]: With dead ends: 56 [2018-09-30 11:00:52,326 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 11:00:52,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 11:00:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 11:00:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-30 11:00:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-30 11:00:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-30 11:00:52,330 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-30 11:00:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 11:00:52,331 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-30 11:00:52,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-30 11:00:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-30 11:00:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-30 11:00:52,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 11:00:52,331 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-09-30 11:00:52,332 INFO L423 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 11:00:52,332 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 11:00:52,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-09-30 11:00:52,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 11:00:52,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 11:00:52,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:52,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 11:00:52,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:00:54,275 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-30 11:00:54,275 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 11:00:54,275 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-30 11:00:54,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 11:00:54,299 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 11:00:54,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 11:00:54,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 11:00:54,401 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-30 11:00:54,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 11:00:54,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-09-30 11:00:54,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-30 11:00:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-30 11:00:54,421 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 11:00:54,421 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-09-30 11:01:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 11:01:03,867 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-30 11:01:03,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 11:01:03,868 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-09-30 11:01:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 11:01:03,869 INFO L225 Difference]: With dead ends: 57 [2018-09-30 11:01:03,869 INFO L226 Difference]: Without dead ends: 56 [2018-09-30 11:01:03,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 11:01:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-30 11:01:03,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-30 11:01:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-30 11:01:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-30 11:01:03,872 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-30 11:01:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 11:01:03,873 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-30 11:01:03,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-30 11:01:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-30 11:01:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-30 11:01:03,873 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 11:01:03,873 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-09-30 11:01:03,873 INFO L423 AbstractCegarLoop]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 11:01:03,873 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 11:01:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-09-30 11:01:03,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 11:01:03,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 11:01:03,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:01:03,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 11:01:03,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:01:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:01:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 11:01:06,344 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 11:01:06,344 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 11:01:06,353 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 11:01:06,389 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-09-30 11:01:06,389 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 11:01:06,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 11:01:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 11:01:06,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 11:01:06,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-09-30 11:01:06,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-30 11:01:06,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-30 11:01:06,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 11:01:06,514 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-09-30 11:01:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 11:01:16,333 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-30 11:01:16,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 11:01:16,333 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-09-30 11:01:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 11:01:16,334 INFO L225 Difference]: With dead ends: 58 [2018-09-30 11:01:16,334 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 11:01:16,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 11:01:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 11:01:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-30 11:01:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 11:01:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-30 11:01:16,340 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-30 11:01:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 11:01:16,340 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-30 11:01:16,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-30 11:01:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-30 11:01:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-30 11:01:16,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 11:01:16,341 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-09-30 11:01:16,341 INFO L423 AbstractCegarLoop]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 11:01:16,341 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 11:01:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-09-30 11:01:16,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 11:01:16,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 11:01:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:01:16,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 11:01:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:01:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-30 11:01:17,634 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 11:01:17,639 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 11:01:17,639 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:01:17 BoogieIcfgContainer [2018-09-30 11:01:17,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 11:01:17,640 INFO L168 Benchmark]: Toolchain (without parser) took 247173.86 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -132.6 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 154.6 MB). Peak memory consumption was 442.3 MB. Max. memory is 7.1 GB. [2018-09-30 11:01:17,642 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 11:01:17,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 11:01:17,643 INFO L168 Benchmark]: Boogie Preprocessor took 23.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 11:01:17,643 INFO L168 Benchmark]: RCFGBuilder took 249.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 11:01:17,644 INFO L168 Benchmark]: TraceAbstraction took 246853.34 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -132.6 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 133.5 MB). Peak memory consumption was 421.1 MB. Max. memory is 7.1 GB. [2018-09-30 11:01:17,647 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 249.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246853.34 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -132.6 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 133.5 MB). Peak memory consumption was 421.1 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 analyzing trace of length 57 with TraceHistMax 54, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 55 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 246.7s OverallTime, 55 OverallIterations, 54 TraceHistogramMax, 189.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 109 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 56927 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2969 GetRequests, 1431 SyntacticMatches, 53 SemanticMatches, 1485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 54 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 52.8s InterpolantComputationTime, 3076 NumberOfCodeBlocks, 3076 NumberOfCodeBlocksAsserted, 485 NumberOfCheckSat, 2969 ConstructedInterpolants, 0 QuantifiedInterpolants, 755363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3127 ConjunctsInSsa, 3021 ConjunctsInUnsatCore, 107 InterpolantComputations, 1 PerfectInterpolantSequences, 0/52470 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-30_11-01-17-658.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-30_11-01-17-658.csv Completed graceful shutdown