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/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:56:34,411 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:56:34,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:56:34,427 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:56:34,427 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:56:34,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:56:34,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:56:34,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:56:34,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:56:34,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:56:34,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:56:34,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:56:34,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:56:34,438 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:56:34,439 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:56:34,440 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:56:34,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:56:34,442 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:56:34,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:56:34,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:56:34,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:56:34,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:56:34,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:56:34,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:56:34,451 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:56:34,452 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:56:34,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:56:34,454 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:56:34,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:56:34,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:56:34,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:56:34,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:56:34,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:56:34,460 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:56:34,461 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:56:34,461 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:56:34,462 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:56:34,477 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:56:34,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:56:34,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:56:34,480 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:56:34,480 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:56:34,481 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:56:34,481 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:56:34,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:56:34,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:56:34,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:56:34,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:56:34,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:56:34,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:56:34,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:56:34,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:56:34,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:56:34,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:56:34,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:56:34,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:56:34,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:56:34,484 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:56:34,485 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:56:34,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:56:34,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:56:34,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:56:34,487 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:56:34,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:56:34,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:56:34,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:56:34,487 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:56:34,487 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:56:34,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:56:34,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:56:34,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:56:34,575 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:56:34,575 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:56:34,576 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-10-04 12:56:34,577 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-10-04 12:56:34,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:56:34,634 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:56:34,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:56:34,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:56:34,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:56:34,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/1) ... [2018-10-04 12:56:34,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/1) ... [2018-10-04 12:56:34,676 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:56:34,677 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:56:34,677 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:56:34,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:56:34,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:56:34,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:56:34,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:56:34,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/1) ... [2018-10-04 12:56:34,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/1) ... [2018-10-04 12:56:34,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/1) ... [2018-10-04 12:56:34,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/1) ... [2018-10-04 12:56:34,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/1) ... [2018-10-04 12:56:34,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/1) ... [2018-10-04 12:56:34,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/1) ... [2018-10-04 12:56:34,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:56:34,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:56:34,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:56:34,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:56:34,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:56:34,764 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 12:56:34,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:56:34,765 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:56:35,012 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:56:35,012 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:56:35 BoogieIcfgContainer [2018-10-04 12:56:35,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:56:35,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:56:35,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:56:35,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:56:35,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:56:34" (1/2) ... [2018-10-04 12:56:35,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138a4ced and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:56:35, skipping insertion in model container [2018-10-04 12:56:35,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:56:35" (2/2) ... [2018-10-04 12:56:35,021 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-10-04 12:56:35,032 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:56:35,042 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:56:35,089 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:56:35,090 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:56:35,090 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:56:35,090 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:56:35,090 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:56:35,090 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:56:35,091 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:56:35,091 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:56:35,091 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:56:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 12:56:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:56:35,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:35,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:56:35,114 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:35,120 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash 30240, now seen corresponding path program 1 times [2018-10-04 12:56:35,122 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:35,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:35,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:35,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:56:35,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:56:35,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:56:35,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:56:35,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:35,296 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 12:56:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:35,361 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-10-04 12:56:35,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:56:35,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 12:56:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:35,381 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:56:35,381 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:56:35,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:56:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:56:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-04 12:56:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:56:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-10-04 12:56:35,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-10-04 12:56:35,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:35,462 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-10-04 12:56:35,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:56:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-04 12:56:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:56:35,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:35,463 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:56:35,463 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:35,464 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:35,464 INFO L82 PathProgramCache]: Analyzing trace with hash 28755491, now seen corresponding path program 1 times [2018-10-04 12:56:35,464 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:35,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:35,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:35,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:35,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:35,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:35,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:35,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:35,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:35,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:56:35,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:56:35,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:56:35,655 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:35,655 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-10-04 12:56:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:35,694 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-10-04 12:56:35,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:56:35,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 12:56:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:35,698 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:56:35,698 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:56:35,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 12:56:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:56:35,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-10-04 12:56:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:56:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-10-04 12:56:35,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-10-04 12:56:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:35,704 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-10-04 12:56:35,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:56:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-10-04 12:56:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:56:35,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:35,706 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:56:35,706 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:35,706 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:35,706 INFO L82 PathProgramCache]: Analyzing trace with hash 28757413, now seen corresponding path program 1 times [2018-10-04 12:56:35,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:35,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:35,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:35,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:35,775 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:35,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:35,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:35,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:35,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:56:35,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:56:35,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:56:35,838 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:35,838 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2018-10-04 12:56:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:35,864 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2018-10-04 12:56:35,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:56:35,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 12:56:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:35,866 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:56:35,866 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:56:35,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 12:56:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:56:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-10-04 12:56:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:56:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-10-04 12:56:35,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-10-04 12:56:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:35,870 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-10-04 12:56:35,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:56:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-10-04 12:56:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:56:35,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:35,871 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-10-04 12:56:35,871 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:35,871 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1863917926, now seen corresponding path program 2 times [2018-10-04 12:56:35,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:35,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:35,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:35,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:35,963 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:35,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:35,991 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:35,992 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:35,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:36,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:36,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:56:36,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:56:36,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:56:36,076 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:36,076 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2018-10-04 12:56:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:36,118 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-10-04 12:56:36,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:56:36,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 12:56:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:36,119 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:56:36,119 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:56:36,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 12:56:36,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:56:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-10-04 12:56:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:56:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 12:56:36,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 12:56:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:36,124 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 12:56:36,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:56:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 12:56:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:56:36,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:36,125 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 12:56:36,125 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:36,125 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1863919848, now seen corresponding path program 1 times [2018-10-04 12:56:36,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:36,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:36,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:36,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:36,303 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:36,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:36,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:36,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:36,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:56:36,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:56:36,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:56:36,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:36,440 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2018-10-04 12:56:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:36,466 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-10-04 12:56:36,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:56:36,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 12:56:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:36,469 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:56:36,469 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:56:36,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 3 [2018-10-04 12:56:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:56:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-10-04 12:56:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:56:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 12:56:36,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 12:56:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:36,475 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 12:56:36,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:56:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 12:56:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:56:36,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:36,476 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 12:56:36,476 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:36,476 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:36,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1865764968, now seen corresponding path program 2 times [2018-10-04 12:56:36,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:36,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:36,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:36,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:36,563 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:36,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:36,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:36,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:36,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:36,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:36,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:56:36,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:56:36,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:56:36,638 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:36,638 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2018-10-04 12:56:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:36,675 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-10-04 12:56:36,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:56:36,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 12:56:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:36,677 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:56:36,678 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:56:36,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:56:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:56:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-10-04 12:56:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:56:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 12:56:36,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2018-10-04 12:56:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:36,684 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 12:56:36,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:56:36,684 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 12:56:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:56:36,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:36,685 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-10-04 12:56:36,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:36,685 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:36,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1865766890, now seen corresponding path program 2 times [2018-10-04 12:56:36,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:36,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:36,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:36,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:36,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:36,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:36,735 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:36,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:36,750 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:36,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:36,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:36,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:36,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:56:36,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:56:36,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:56:36,885 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:36,885 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 5 states. [2018-10-04 12:56:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:36,914 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2018-10-04 12:56:36,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:56:36,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 12:56:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:36,917 INFO L225 Difference]: With dead ends: 16 [2018-10-04 12:56:36,917 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:56:36,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 12:56:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:56:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-10-04 12:56:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:56:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 12:56:36,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 12:56:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:36,921 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 12:56:36,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:56:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 12:56:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:56:36,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:36,922 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-10-04 12:56:36,922 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:36,922 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:36,922 INFO L82 PathProgramCache]: Analyzing trace with hash 223459305, now seen corresponding path program 3 times [2018-10-04 12:56:36,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:36,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:36,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:36,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:36,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:36,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:36,970 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:36,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:36,990 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:56:36,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:36,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:37,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:37,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:56:37,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:56:37,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:56:37,087 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:37,088 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2018-10-04 12:56:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:37,126 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 12:56:37,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:56:37,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:56:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:37,128 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:56:37,128 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:56:37,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 12:56:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:56:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-10-04 12:56:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:56:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:56:37,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 12:56:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:37,135 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:56:37,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:56:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:56:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:56:37,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:37,136 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:56:37,136 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:37,136 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:37,136 INFO L82 PathProgramCache]: Analyzing trace with hash 223461227, now seen corresponding path program 3 times [2018-10-04 12:56:37,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:37,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:37,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:37,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:37,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:37,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:37,207 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:37,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:37,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:56:37,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:37,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:37,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:37,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:56:37,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:56:37,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:56:37,288 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:37,289 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 12:56:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:37,441 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-10-04 12:56:37,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:56:37,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:56:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:37,443 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:56:37,443 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:56:37,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 12:56:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:56:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-10-04 12:56:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:56:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 12:56:37,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 12:56:37,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:37,449 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 12:56:37,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:56:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 12:56:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:56:37,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:37,451 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:56:37,451 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:37,451 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:37,451 INFO L82 PathProgramCache]: Analyzing trace with hash 225306347, now seen corresponding path program 4 times [2018-10-04 12:56:37,451 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:37,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:37,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:37,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:37,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:37,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:37,801 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:37,802 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:37,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:37,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:37,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:56:37,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:56:37,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:56:37,852 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:37,852 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2018-10-04 12:56:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:37,883 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 12:56:37,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:56:37,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:56:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:37,884 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:56:37,884 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:56:37,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 4 [2018-10-04 12:56:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:56:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-10-04 12:56:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:56:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:56:37,890 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 12:56:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:37,890 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:56:37,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:56:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:56:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:56:37,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:37,891 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:56:37,891 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:37,891 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash 225308269, now seen corresponding path program 5 times [2018-10-04 12:56:37,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:37,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:37,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:37,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:37,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:37,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:37,956 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:37,964 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:37,996 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 12:56:37,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:37,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:38,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:38,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:56:38,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:56:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:56:38,065 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:38,065 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 12:56:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:38,090 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-10-04 12:56:38,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:56:38,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:56:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:38,092 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:56:38,092 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:56:38,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 12:56:38,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:56:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-10-04 12:56:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:56:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 12:56:38,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 12:56:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:38,097 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 12:56:38,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:56:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 12:56:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:56:38,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:38,098 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:56:38,098 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:38,098 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1998466667, now seen corresponding path program 6 times [2018-10-04 12:56:38,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:38,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:38,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:38,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:38,153 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:38,162 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:38,187 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 12:56:38,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:38,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:38,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:38,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:56:38,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:56:38,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:56:38,242 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:38,242 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2018-10-04 12:56:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:38,274 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 12:56:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:56:38,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:56:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:38,275 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:56:38,276 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:56:38,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 12:56:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:56:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-10-04 12:56:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:56:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:56:38,283 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2018-10-04 12:56:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:38,283 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:56:38,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:56:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:56:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:56:38,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:38,284 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:56:38,284 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:38,284 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:38,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1998468589, now seen corresponding path program 7 times [2018-10-04 12:56:38,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:38,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:38,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:38,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:38,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:38,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:38,351 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:38,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:38,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:38,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:38,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:56:38,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:56:38,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:56:38,421 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:38,421 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 6 states. [2018-10-04 12:56:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:38,450 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 12:56:38,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:56:38,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:56:38,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:38,451 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:56:38,451 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:56:38,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 12:56:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:56:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-10-04 12:56:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:56:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:56:38,460 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 12:56:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:38,460 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:56:38,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:56:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:56:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:56:38,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:38,461 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:56:38,461 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:38,462 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:38,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2000313709, now seen corresponding path program 8 times [2018-10-04 12:56:38,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:38,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:38,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:38,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:38,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:38,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:38,552 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:38,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:38,568 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:38,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:38,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:38,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:38,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:56:38,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:56:38,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:56:38,625 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:38,625 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 12:56:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:38,675 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-10-04 12:56:38,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:56:38,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:56:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:38,681 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:56:38,681 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:56:38,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 12:56:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:56:38,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-10-04 12:56:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:56:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:56:38,686 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2018-10-04 12:56:38,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:38,687 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:56:38,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:56:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:56:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:56:38,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:38,688 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-10-04 12:56:38,688 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:38,688 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:38,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2000315631, now seen corresponding path program 3 times [2018-10-04 12:56:38,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:38,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:38,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:38,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:38,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:38,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:38,754 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:38,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:38,792 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:56:38,792 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:38,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:38,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:38,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:56:38,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:56:38,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:56:38,864 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:38,864 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 6 states. [2018-10-04 12:56:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:38,906 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2018-10-04 12:56:38,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:56:38,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:56:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:38,909 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:56:38,909 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:56:38,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 12:56:38,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:56:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-10-04 12:56:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:56:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 12:56:38,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 12:56:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:38,914 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 12:56:38,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:56:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 12:56:38,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:38,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:38,915 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-10-04 12:56:38,916 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:38,916 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:38,916 INFO L82 PathProgramCache]: Analyzing trace with hash -4277844, now seen corresponding path program 4 times [2018-10-04 12:56:38,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:38,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:38,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:38,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:38,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:38,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:38,991 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:39,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:39,005 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:39,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:39,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:39,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:39,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:39,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:39,115 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:39,116 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2018-10-04 12:56:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:39,151 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 12:56:39,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:39,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:39,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:39,152 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:56:39,152 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:56:39,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:56:39,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:56:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-10-04 12:56:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:56:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:56:39,159 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:56:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:39,160 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:56:39,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:56:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:39,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:39,160 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:56:39,161 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:39,161 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash -4275922, now seen corresponding path program 9 times [2018-10-04 12:56:39,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:39,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:39,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:39,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:39,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:39,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:39,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:39,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:39,446 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 12:56:39,446 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:39,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:39,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:39,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:39,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:39,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:39,500 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:39,500 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:56:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:39,550 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 12:56:39,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:39,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:39,551 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:56:39,551 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:56:39,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 5 [2018-10-04 12:56:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:56:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-10-04 12:56:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:56:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:56:39,558 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 12:56:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:39,559 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:56:39,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:56:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:39,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:39,560 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:56:39,560 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:39,560 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2430802, now seen corresponding path program 10 times [2018-10-04 12:56:39,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:39,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:39,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:39,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:39,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:39,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:39,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:39,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:39,654 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:39,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:39,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:39,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:39,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:39,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:39,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:39,703 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:39,704 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 12:56:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:39,766 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 12:56:39,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:39,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:39,767 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:56:39,767 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:56:39,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:56:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:56:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-10-04 12:56:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:56:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:56:39,776 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:56:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:39,776 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:56:39,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:56:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:39,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:39,777 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:56:39,777 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:39,778 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:39,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2428880, now seen corresponding path program 11 times [2018-10-04 12:56:39,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:39,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:39,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:39,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:39,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:39,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:39,906 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:39,915 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:39,927 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-04 12:56:39,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:39,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:40,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:40,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:40,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:40,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:40,036 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:40,036 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:56:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:40,209 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-10-04 12:56:40,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:40,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:40,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:40,210 INFO L225 Difference]: With dead ends: 22 [2018-10-04 12:56:40,210 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:56:40,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:56:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:56:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-10-04 12:56:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:56:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:56:40,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 12:56:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:40,217 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:56:40,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:56:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:40,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:40,218 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:56:40,218 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:40,218 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1770729518, now seen corresponding path program 12 times [2018-10-04 12:56:40,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:40,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:40,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:40,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:40,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:40,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:40,277 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:40,287 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:40,294 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-04 12:56:40,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:40,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:40,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:40,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:40,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:40,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:40,349 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:40,349 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2018-10-04 12:56:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:40,485 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 12:56:40,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:40,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:40,487 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:56:40,487 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:56:40,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:56:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:56:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-10-04 12:56:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:56:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:56:40,496 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:56:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:40,496 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:56:40,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:56:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:40,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:40,497 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:56:40,497 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:40,497 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:40,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1770731440, now seen corresponding path program 13 times [2018-10-04 12:56:40,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:40,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:40,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:40,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:40,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:40,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:40,555 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:40,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:40,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:40,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:40,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:40,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:40,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:40,684 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:40,684 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:56:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:40,723 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 12:56:40,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:40,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:40,724 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:56:40,724 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:56:40,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:56:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:56:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-10-04 12:56:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:56:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:56:40,731 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 12:56:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:40,731 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:56:40,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:56:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:40,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:40,732 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:56:40,733 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:40,733 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:40,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1772576560, now seen corresponding path program 14 times [2018-10-04 12:56:40,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:40,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:40,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:40,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:40,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:40,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:40,813 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:40,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:40,831 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:40,831 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:40,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:40,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:40,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:40,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:40,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:40,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:40,873 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 12:56:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:41,023 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 12:56:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:41,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:41,024 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:56:41,025 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:56:41,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:56:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:56:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-10-04 12:56:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:56:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:56:41,036 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:56:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:41,037 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:56:41,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:56:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:41,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:41,037 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:56:41,038 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:41,038 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1772578482, now seen corresponding path program 15 times [2018-10-04 12:56:41,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:41,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:41,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:41,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:41,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:41,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:41,475 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:41,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:41,491 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 12:56:41,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:41,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:41,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:41,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:41,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:41,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:41,553 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:41,553 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:56:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:41,650 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-10-04 12:56:41,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:41,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:41,651 INFO L225 Difference]: With dead ends: 22 [2018-10-04 12:56:41,651 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:56:41,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 5 [2018-10-04 12:56:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:56:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-10-04 12:56:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:56:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:56:41,657 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 12:56:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:41,657 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:56:41,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:56:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:41,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:41,658 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:56:41,658 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:41,658 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:41,658 INFO L82 PathProgramCache]: Analyzing trace with hash 675780526, now seen corresponding path program 16 times [2018-10-04 12:56:41,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:41,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:41,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:41,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:41,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:41,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:41,746 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:41,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:41,789 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:41,789 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:41,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:41,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:41,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:41,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:41,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:41,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:41,917 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2018-10-04 12:56:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:41,974 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:56:41,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:41,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:41,975 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:56:41,975 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:56:41,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:56:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:56:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 12:56:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:41,984 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 12:56:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:41,985 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:41,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:41,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:41,986 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:56:41,986 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:41,986 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash 675782448, now seen corresponding path program 17 times [2018-10-04 12:56:41,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:41,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:41,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:41,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:41,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:42,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:42,051 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:42,059 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:42,065 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-04 12:56:42,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:42,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:42,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:42,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:42,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:42,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:42,108 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:42,108 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 12:56:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:42,160 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:56:42,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:42,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:42,161 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:56:42,161 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:56:42,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:56:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:56:42,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-10-04 12:56:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:56:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:56:42,170 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:56:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:42,171 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:56:42,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:56:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:42,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:42,172 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:56:42,172 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:42,172 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:42,172 INFO L82 PathProgramCache]: Analyzing trace with hash 677627568, now seen corresponding path program 18 times [2018-10-04 12:56:42,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:42,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:42,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:42,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:42,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:42,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:42,215 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:42,224 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:42,236 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-04 12:56:42,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:42,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:42,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:42,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:42,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:42,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:42,323 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:56:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:42,360 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:56:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:42,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:42,361 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:56:42,361 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:56:42,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:56:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:56:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 12:56:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:42,370 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 12:56:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:42,371 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:42,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:42,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:42,372 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:56:42,372 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:42,372 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash 677629490, now seen corresponding path program 19 times [2018-10-04 12:56:42,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:42,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:42,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:42,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:42,423 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:42,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:42,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:42,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:42,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:42,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:42,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:42,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:42,484 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 12:56:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:42,510 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:56:42,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:42,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:42,511 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:56:42,511 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:56:42,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:56:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:56:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-10-04 12:56:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:56:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:56:42,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 12:56:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:42,520 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:56:42,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:56:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:42,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:42,521 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:56:42,521 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:42,521 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:42,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1844179408, now seen corresponding path program 20 times [2018-10-04 12:56:42,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:42,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:42,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:42,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:42,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:42,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:42,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:42,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:42,615 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:42,615 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:42,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:42,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:42,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:42,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:42,665 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:42,666 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 12:56:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:42,851 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 12:56:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:42,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:42,852 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:56:42,852 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:56:42,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:56:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:56:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-10-04 12:56:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:42,863 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 12:56:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:42,863 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:42,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:42,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:42,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:42,864 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:56:42,864 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:42,864 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:42,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1844177486, now seen corresponding path program 21 times [2018-10-04 12:56:42,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:42,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:42,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:42,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:42,906 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:42,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:42,932 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 12:56:42,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:42,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:43,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:43,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:43,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:43,016 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:43,016 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 12:56:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:43,061 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 12:56:43,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:43,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:43,062 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:56:43,062 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:56:43,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:56:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:56:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-10-04 12:56:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:56:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:56:43,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:56:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:43,074 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:56:43,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:56:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:43,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:43,075 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:56:43,075 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:43,075 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:43,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1842332366, now seen corresponding path program 22 times [2018-10-04 12:56:43,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:43,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:43,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:43,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:43,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:43,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:43,119 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:43,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:43,138 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:43,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:43,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:43,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:43,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:43,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:43,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:43,181 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:43,182 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:56:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:43,227 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 12:56:43,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:43,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:43,228 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:56:43,228 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:56:43,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:56:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:56:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-10-04 12:56:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:43,238 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 12:56:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:43,239 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:43,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:56:43,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:43,240 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-10-04 12:56:43,240 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:43,240 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:43,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1842330444, now seen corresponding path program 4 times [2018-10-04 12:56:43,241 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:43,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:43,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:43,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:43,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:43,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:43,308 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:43,318 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:43,323 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:43,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:43,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:43,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:43,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:56:43,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:56:43,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:56:43,398 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:43,398 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 12:56:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:43,423 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2018-10-04 12:56:43,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:56:43,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:56:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:43,424 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:56:43,425 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:56:43,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:56:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:56:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-10-04 12:56:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:56:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:56:43,431 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 12:56:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:43,431 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:56:43,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:56:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:56:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:43,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:43,432 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2018-10-04 12:56:43,432 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:43,433 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash 183654063, now seen corresponding path program 5 times [2018-10-04 12:56:43,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:43,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:43,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:43,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:43,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:43,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:43,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:43,505 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:43,578 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:56:43,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:43,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:43,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:43,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:43,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:43,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:43,776 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:43,776 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2018-10-04 12:56:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:43,807 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:56:43,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:43,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:43,808 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:56:43,808 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:56:43,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 6 [2018-10-04 12:56:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:56:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 12:56:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:43,822 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:43,822 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:43,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:43,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:43,823 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:56:43,823 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:43,823 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:43,823 INFO L82 PathProgramCache]: Analyzing trace with hash 183655985, now seen corresponding path program 23 times [2018-10-04 12:56:43,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:43,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:43,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:43,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:43,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:43,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:43,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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:43,895 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:43,902 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:56:43,902 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:43,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:43,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:43,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:43,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:43,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:43,971 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:43,971 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:44,010 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:56:44,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:44,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:44,011 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:56:44,011 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:56:44,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:56:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 12:56:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:44,024 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:56:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:44,024 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:44,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:44,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:44,025 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:56:44,025 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:44,025 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash 185501105, now seen corresponding path program 24 times [2018-10-04 12:56:44,025 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:44,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:44,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:44,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:44,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:44,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:44,101 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:44,109 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:44,117 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 12:56:44,117 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:44,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:44,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:44,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:44,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:44,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:44,173 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:44,174 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:56:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:44,353 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:56:44,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:44,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:44,354 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:56:44,354 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:56:44,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:56:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 12:56:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:44,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:44,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:44,367 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:44,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:44,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:44,367 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:44,368 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:44,368 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:44,368 INFO L82 PathProgramCache]: Analyzing trace with hash 185503027, now seen corresponding path program 25 times [2018-10-04 12:56:44,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:44,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:44,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:44,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:44,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:44,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:44,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:44,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:44,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:44,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:44,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:44,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:44,503 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:44,503 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:44,541 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:56:44,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:44,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:44,541 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:56:44,541 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:56:44,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:56:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-10-04 12:56:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:56:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:56:44,551 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 12:56:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:44,552 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:56:44,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:56:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:44,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:44,552 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:56:44,552 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:44,552 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1958661425, now seen corresponding path program 26 times [2018-10-04 12:56:44,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:44,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:44,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:44,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:44,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:44,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:44,721 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:44,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:44,733 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:44,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:44,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:44,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:44,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:44,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:44,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:44,785 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:44,785 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 12:56:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:44,822 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:56:44,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:44,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:44,823 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:56:44,823 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:56:44,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:56:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:56:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-10-04 12:56:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:44,838 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:44,838 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:44,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:44,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:44,839 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:44,839 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:44,839 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1958663347, now seen corresponding path program 27 times [2018-10-04 12:56:44,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:44,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:44,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:44,923 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:44,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:44,940 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:56:44,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:44,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:45,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:45,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:45,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:45,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:45,009 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:45,010 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:45,065 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:56:45,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:45,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:45,066 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:56:45,066 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:56:45,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:56:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:56:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-04 12:56:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:45,080 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:56:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:45,080 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:45,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:45,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:45,081 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:45,081 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:45,081 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:45,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1960508467, now seen corresponding path program 28 times [2018-10-04 12:56:45,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:45,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:45,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:45,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:45,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:45,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:45,169 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:45,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:45,182 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:45,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:45,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:45,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:45,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:45,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:45,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:45,228 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:45,228 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:56:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:45,316 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 12:56:45,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:45,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:45,317 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:56:45,317 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:56:45,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:56:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-04 12:56:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:45,335 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:45,335 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:45,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:45,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:45,336 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:45,336 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:45,336 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1960510389, now seen corresponding path program 29 times [2018-10-04 12:56:45,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:45,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:45,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:45,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:45,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:45,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:45,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:45,869 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:45,883 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:56:45,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:45,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:45,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:45,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:45,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:45,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:45,941 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:45,941 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:45,976 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2018-10-04 12:56:45,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:45,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:45,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:45,977 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:56:45,977 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:56:45,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 6 [2018-10-04 12:56:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:56:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-10-04 12:56:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:56:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:56:45,992 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 12:56:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:45,992 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:56:45,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:56:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:45,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:45,993 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:56:45,993 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:45,993 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:45,994 INFO L82 PathProgramCache]: Analyzing trace with hash 863712433, now seen corresponding path program 30 times [2018-10-04 12:56:45,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:45,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:45,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:45,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:46,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:46,059 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:46,069 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:46,104 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 12:56:46,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:46,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:46,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:46,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:46,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:46,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:46,160 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:46,160 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 8 states. [2018-10-04 12:56:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:46,224 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:56:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:46,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:46,225 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:56:46,225 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:56:46,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:56:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 12:56:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:46,241 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:46,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:46,241 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:46,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:46,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:46,250 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:46,250 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:46,250 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash 863714355, now seen corresponding path program 31 times [2018-10-04 12:56:46,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:46,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:46,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:46,297 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:46,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:46,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:46,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:46,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:46,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:46,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:46,358 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:46,358 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:46,558 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:56:46,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:46,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:46,559 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:56:46,559 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:56:46,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:56:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 12:56:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:46,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:56:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:46,575 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:46,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:46,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:46,576 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:46,576 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:46,576 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:46,576 INFO L82 PathProgramCache]: Analyzing trace with hash 865559475, now seen corresponding path program 32 times [2018-10-04 12:56:46,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:46,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:46,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:46,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:46,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:46,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:46,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:46,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:46,652 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:46,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:46,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:46,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:46,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:46,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:46,729 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:46,729 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:56:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:46,789 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:56:46,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:46,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:46,790 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:56:46,790 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:56:46,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:56:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:56:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 12:56:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:46,804 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:46,804 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:46,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:46,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:46,804 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:46,805 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:46,805 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:46,805 INFO L82 PathProgramCache]: Analyzing trace with hash 865561397, now seen corresponding path program 33 times [2018-10-04 12:56:46,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:46,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:46,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:46,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:46,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:46,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:46,860 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:46,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:46,880 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:56:46,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:46,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:46,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:46,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:46,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:46,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:46,937 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:46,937 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:46,975 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:56:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:46,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:46,976 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:56:46,977 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:56:46,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:56:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-10-04 12:56:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:56:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:56:46,993 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 12:56:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:46,993 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:56:46,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:46,993 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:56:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:46,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:46,993 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:46,994 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:46,994 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:46,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1656247501, now seen corresponding path program 34 times [2018-10-04 12:56:46,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:46,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:46,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:46,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:46,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:47,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:47,151 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:47,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:47,163 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:47,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:47,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:47,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:47,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:47,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:47,209 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:47,209 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 12:56:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:47,246 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:56:47,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:47,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:47,247 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:56:47,247 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:56:47,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:56:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:56:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-10-04 12:56:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:47,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:47,265 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:47,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:47,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:47,266 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:47,266 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:47,266 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:47,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1656245579, now seen corresponding path program 35 times [2018-10-04 12:56:47,266 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:47,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:47,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:47,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:47,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:47,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:47,415 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:47,423 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:47,431 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:56:47,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:47,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:47,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:47,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:47,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:47,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:47,475 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:47,475 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:47,508 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:56:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:47,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:47,509 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:56:47,509 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:56:47,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:56:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:56:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-04 12:56:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:47,524 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:56:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:47,524 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:47,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:47,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:47,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:47,525 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:47,525 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:47,525 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:47,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1654400459, now seen corresponding path program 36 times [2018-10-04 12:56:47,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:47,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:47,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:47,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:47,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:47,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:47,585 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:47,591 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 12:56:47,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:47,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:47,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:47,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:47,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:47,641 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:47,641 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:56:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:47,672 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 12:56:47,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:47,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:47,673 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:56:47,673 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:56:47,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:56:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-04 12:56:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:47,690 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:47,690 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:47,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:47,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:47,691 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:56:47,691 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:47,691 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:47,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1654398537, now seen corresponding path program 37 times [2018-10-04 12:56:47,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:47,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:47,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:47,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:47,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:47,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:47,734 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:47,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:47,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:47,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:47,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:47,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:47,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:47,815 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:47,914 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2018-10-04 12:56:47,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:47,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:47,915 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:56:47,915 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:56:47,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:56:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-10-04 12:56:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:56:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:56:47,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 12:56:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:47,928 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:56:47,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:56:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:47,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:47,929 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:56:47,929 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:47,929 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:47,929 INFO L82 PathProgramCache]: Analyzing trace with hash 884718641, now seen corresponding path program 38 times [2018-10-04 12:56:47,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:47,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:47,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:48,026 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:48,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:48,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:48,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:48,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:48,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:48,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:48,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:48,095 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 8 states. [2018-10-04 12:56:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:48,144 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:56:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:48,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:48,145 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:56:48,145 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:56:48,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:56:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:56:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 12:56:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:48,167 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:56:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:48,167 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:48,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:48,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:48,168 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:48,168 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:48,168 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash 884720563, now seen corresponding path program 39 times [2018-10-04 12:56:48,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:48,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:48,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:48,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:48,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:48,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:48,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:48,235 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:56:48,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:48,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:48,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:48,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:48,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:48,279 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:48,279 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:56:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:48,344 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:56:48,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:48,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:48,344 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:56:48,345 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:56:48,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:56:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 12:56:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:48,363 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:48,364 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:48,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:48,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:48,364 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:48,364 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:48,364 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 886565683, now seen corresponding path program 40 times [2018-10-04 12:56:48,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:48,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:48,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:48,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:48,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:48,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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:48,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:48,425 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:48,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:48,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:48,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:48,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:48,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:48,485 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:48,485 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:48,535 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:56:48,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:48,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:48,536 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:56:48,536 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:56:48,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:56:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 12:56:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:48,556 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:56:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:48,556 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:48,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:48,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:48,557 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:48,557 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:48,558 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:48,558 INFO L82 PathProgramCache]: Analyzing trace with hash 886567605, now seen corresponding path program 41 times [2018-10-04 12:56:48,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:48,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:48,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:48,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:48,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:48,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:48,641 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:48,647 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:56:48,647 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:48,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:48,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:48,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:48,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:48,699 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:48,699 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:56:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:48,740 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:56:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:48,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:48,741 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:56:48,741 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:56:48,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:56:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-10-04 12:56:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:48,759 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:56:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:48,759 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:48,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:48,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:48,760 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:48,760 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:48,760 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1635241293, now seen corresponding path program 42 times [2018-10-04 12:56:48,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:48,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:48,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:48,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:48,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:48,805 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:48,813 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:48,819 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 12:56:48,819 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:48,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:48,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:48,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:48,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:48,866 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:48,866 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:56:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:48,953 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:56:48,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:48,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:48,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:48,954 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:56:48,954 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:56:48,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:56:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 12:56:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:48,976 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:56:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:48,976 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:48,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:48,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:48,976 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:48,977 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:48,977 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:48,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1635239371, now seen corresponding path program 43 times [2018-10-04 12:56:48,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:48,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:48,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:48,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:48,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:49,058 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:49,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:49,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:49,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:49,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:49,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:49,125 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:49,125 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:56:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:49,194 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:56:49,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:49,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:49,195 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:56:49,195 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:56:49,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:56:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:56:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 12:56:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:49,215 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:49,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:49,215 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:49,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:49,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:49,215 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:49,215 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:49,216 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1633394251, now seen corresponding path program 44 times [2018-10-04 12:56:49,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:49,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:49,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:49,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:49,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:49,272 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:49,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:49,284 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:49,285 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:49,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:49,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:49,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:49,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:49,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:49,339 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:49,411 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:56:49,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:49,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:49,412 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:56:49,412 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:56:49,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:56:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 12:56:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:49,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:56:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:49,434 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:49,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:49,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:49,434 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:56:49,435 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:49,435 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:49,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1633392329, now seen corresponding path program 45 times [2018-10-04 12:56:49,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:49,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:49,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:49,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:49,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:49,491 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:49,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:49,508 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:56:49,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:49,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:49,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:49,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:49,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:49,566 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:49,566 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:56:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:49,616 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:56:49,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:49,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:49,616 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:56:49,617 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:56:49,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:56:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 18. [2018-10-04 12:56:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:56:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:56:49,635 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 12:56:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:49,636 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:56:49,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:56:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:49,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:49,637 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:49,637 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:49,637 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1564777011, now seen corresponding path program 46 times [2018-10-04 12:56:49,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:49,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:49,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:49,679 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:49,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:49,692 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:49,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:49,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:49,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:49,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:49,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:49,738 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:49,738 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 12:56:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:49,804 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:56:49,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:49,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:49,804 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:56:49,805 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:56:49,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:56:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 12:56:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:49,829 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:56:49,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:49,829 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:49,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:49,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:49,830 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:49,830 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:49,830 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1564778933, now seen corresponding path program 47 times [2018-10-04 12:56:49,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:49,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:49,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:49,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:49,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:49,878 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:49,886 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:49,894 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:56:49,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:49,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:49,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:49,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:49,948 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:49,948 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:56:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:50,016 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:56:50,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:50,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:50,019 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:56:50,020 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:56:50,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:56:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 12:56:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:50,045 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:50,045 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:50,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:50,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:50,046 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:50,046 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:50,046 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:50,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1566624053, now seen corresponding path program 48 times [2018-10-04 12:56:50,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:50,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:50,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:50,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:50,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:50,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:50,136 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:50,144 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:50,153 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 12:56:50,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:50,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:50,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:50,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:50,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:50,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:50,211 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:50,211 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:50,292 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:56:50,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:50,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:50,293 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:56:50,293 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:56:50,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:56:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:56:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 12:56:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:50,321 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:56:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:50,321 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:50,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:50,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:50,322 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:56:50,322 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:50,322 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1566625975, now seen corresponding path program 49 times [2018-10-04 12:56:50,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:50,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:50,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:50,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:50,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:50,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:50,410 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:50,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:50,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:50,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:50,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:50,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:50,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:50,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:50,491 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:56:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:50,643 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:56:50,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:50,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:50,644 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:56:50,644 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:56:50,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:56:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:56:50,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-10-04 12:56:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:50,666 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:56:50,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:50,666 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:50,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:50,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:50,667 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:56:50,667 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:50,667 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash -955182923, now seen corresponding path program 50 times [2018-10-04 12:56:50,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:50,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:50,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:50,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:50,711 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:50,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:50,723 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:50,723 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:50,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:50,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:50,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:50,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:50,777 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:50,777 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:56:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:50,822 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:56:50,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:50,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:50,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:50,823 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:56:50,823 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:56:50,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:56:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-10-04 12:56:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:50,847 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:56:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:50,847 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:50,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:50,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:50,848 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:56:50,848 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:50,848 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:50,848 INFO L82 PathProgramCache]: Analyzing trace with hash -955181001, now seen corresponding path program 51 times [2018-10-04 12:56:50,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:50,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:50,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:50,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:50,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:50,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:50,886 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:50,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:50,900 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:56:50,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:50,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:50,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:50,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:50,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:50,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:50,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:50,949 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:56:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:51,003 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:56:51,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:51,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:51,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:51,004 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:56:51,004 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:56:51,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:56:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-10-04 12:56:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:51,028 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:56:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:51,028 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:51,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:51,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:51,028 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:56:51,028 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:51,029 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:51,029 INFO L82 PathProgramCache]: Analyzing trace with hash -953335881, now seen corresponding path program 52 times [2018-10-04 12:56:51,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:51,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:51,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:51,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:51,079 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:51,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:51,114 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:51,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:51,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:51,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:51,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:51,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:51,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:51,178 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:56:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:51,224 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:56:51,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:51,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:51,225 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:56:51,225 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:56:51,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:56:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-10-04 12:56:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:51,249 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:56:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:51,249 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:51,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:56:51,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:51,249 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2018-10-04 12:56:51,250 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:51,250 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash -953333959, now seen corresponding path program 5 times [2018-10-04 12:56:51,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:51,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:51,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:51,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:51,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:51,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:51,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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:51,307 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:51,315 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:56:51,315 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:51,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:51,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:51,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:56:51,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:56:51,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:56:51,366 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:51,367 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:56:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:51,413 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-10-04 12:56:51,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:56:51,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:56:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:51,414 INFO L225 Difference]: With dead ends: 28 [2018-10-04 12:56:51,414 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:56:51,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 12:56:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:56:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-10-04 12:56:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:56:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:56:51,431 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 12:56:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:51,431 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:56:51,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:56:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:56:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:51,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:51,431 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2018-10-04 12:56:51,431 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:51,432 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:51,432 INFO L82 PathProgramCache]: Analyzing trace with hash 397590258, now seen corresponding path program 6 times [2018-10-04 12:56:51,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:51,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:51,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:51,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:51,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:51,499 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:51,511 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:51,518 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:56:51,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:51,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:51,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:51,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:51,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:51,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:51,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:51,573 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2018-10-04 12:56:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:51,653 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:56:51,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:51,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:51,654 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:56:51,654 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:56:51,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:56:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:56:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:51,690 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:51,690 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:51,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:51,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:51,691 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:56:51,691 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:51,692 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash 397592180, now seen corresponding path program 53 times [2018-10-04 12:56:51,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:51,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:51,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:51,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:51,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:51,814 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:51,821 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:56:51,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:51,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:51,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:51,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:51,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:51,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:51,872 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:51,872 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:51,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:51,954 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:56:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:51,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:51,955 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:56:51,955 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:56:51,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:56:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:56:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:56:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:51,987 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:56:51,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:51,987 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:51,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:51,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:51,988 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:56:51,988 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:51,988 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:51,988 INFO L82 PathProgramCache]: Analyzing trace with hash 399437300, now seen corresponding path program 54 times [2018-10-04 12:56:51,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:51,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:51,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:51,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:51,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:52,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:52,047 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:52,055 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:52,063 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:56:52,064 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:52,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:52,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:52,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:52,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:52,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:52,120 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:52,120 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:56:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:52,206 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:56:52,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:52,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:52,207 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:56:52,207 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:56:52,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:56:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:56:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:52,238 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:52,238 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:52,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:52,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:52,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:52,239 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:52,239 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:52,239 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:52,239 INFO L82 PathProgramCache]: Analyzing trace with hash 399439222, now seen corresponding path program 55 times [2018-10-04 12:56:52,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:52,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:52,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:52,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:52,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:52,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:52,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:52,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:52,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:52,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:52,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:52,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:52,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:52,471 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:52,471 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:52,540 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:56:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:52,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:52,541 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:56:52,541 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:56:52,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:56:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:56:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-10-04 12:56:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:52,571 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:56:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:52,571 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:52,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:52,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:52,572 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:56:52,572 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:52,572 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:52,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2122369676, now seen corresponding path program 56 times [2018-10-04 12:56:52,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:52,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:52,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:52,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:52,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:52,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:52,648 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:52,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:52,664 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:52,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:52,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:52,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:52,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:52,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:52,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:52,710 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:52,710 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:56:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:52,796 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:56:52,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:52,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:52,797 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:56:52,797 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:56:52,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:56:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:56:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:52,832 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:52,832 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:52,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:52,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:52,832 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:52,832 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:52,832 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:52,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2122367754, now seen corresponding path program 57 times [2018-10-04 12:56:52,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:52,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:52,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:52,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:52,902 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:52,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:52,922 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:56:52,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:52,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:52,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:52,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:52,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:52,984 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:52,985 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:53,070 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:56:53,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:53,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:53,071 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:56:53,071 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:56:53,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:56:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:56:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:56:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:53,105 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:56:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:53,105 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:53,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:53,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:53,105 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:53,106 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:53,106 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2120522634, now seen corresponding path program 58 times [2018-10-04 12:56:53,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:53,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:53,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:53,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:53,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:53,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:53,177 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:53,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:53,208 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:53,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:53,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:53,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:53,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:53,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:53,268 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:53,268 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:56:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:53,344 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:56:53,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:53,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:53,345 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:56:53,345 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:56:53,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:56:53,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:56:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:53,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:53,381 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:53,381 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:53,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:53,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:53,381 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:56:53,382 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:53,382 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:53,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2120520712, now seen corresponding path program 59 times [2018-10-04 12:56:53,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:53,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:53,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:53,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:53,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:53,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:53,443 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:53,451 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:53,461 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:56:53,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:53,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:53,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:53,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:53,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:53,542 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:53,542 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:53,622 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:56:53,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:53,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:53,623 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:56:53,623 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:56:53,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:56:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:56:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-10-04 12:56:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:53,653 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 12:56:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:53,653 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:53,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:53,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:53,653 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:56:53,654 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:53,654 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1077648628, now seen corresponding path program 60 times [2018-10-04 12:56:53,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:53,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:53,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:53,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:53,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:53,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:53,709 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:53,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:53,725 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:56:53,726 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:53,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:53,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:53,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:53,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:53,786 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:53,786 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 12:56:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:53,880 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:56:53,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:53,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:53,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:53,881 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:56:53,881 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:56:53,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:56:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 12:56:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:53,918 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:53,918 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:53,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:53,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:53,919 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:53,919 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:53,919 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:53,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1077650550, now seen corresponding path program 61 times [2018-10-04 12:56:53,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:53,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:53,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:53,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:53,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:53,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:53,981 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:53,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:53,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:54,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:54,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:54,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:54,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:54,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:54,062 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:54,151 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:56:54,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:54,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:54,153 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:56:54,153 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:56:54,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:56:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 12:56:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:54,192 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:56:54,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:54,192 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:54,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:54,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:54,193 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:54,193 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:54,193 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:54,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1079495670, now seen corresponding path program 62 times [2018-10-04 12:56:54,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:54,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:54,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:54,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:54,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:54,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:54,255 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:54,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:54,274 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:54,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:54,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:54,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:54,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:54,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:54,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:54,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:54,336 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:56:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:54,432 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:56:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:54,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:54,434 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:56:54,434 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:56:54,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:56:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 12:56:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:54,477 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:54,477 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:54,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:54,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:54,485 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:56:54,486 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:54,486 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:54,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1079497592, now seen corresponding path program 63 times [2018-10-04 12:56:54,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:54,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:54,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:54,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:54,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:54,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:54,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:54,564 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:56:54,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:54,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:54,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:54,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:54,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:54,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:54,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:54,613 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:54,688 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:56:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:54,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:54,689 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:56:54,689 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:56:54,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:56:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-10-04 12:56:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:54,721 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:56:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:54,721 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:54,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:54,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:54,721 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:54,722 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:54,722 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:54,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1442311306, now seen corresponding path program 64 times [2018-10-04 12:56:54,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:54,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:54,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:54,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:54,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:54,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:54,968 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:54,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:54,981 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:54,981 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:54,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:55,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:55,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:55,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:55,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:55,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:55,022 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:56:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:55,088 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:56:55,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:55,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:55,089 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:56:55,089 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:56:55,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 12:56:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:56:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-10-04 12:56:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:55,126 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:55,126 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:55,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:55,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:55,126 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:56:55,127 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:55,127 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1442309384, now seen corresponding path program 65 times [2018-10-04 12:56:55,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:55,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:55,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:55,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:55,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:55,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:55,265 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:55,285 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:56:55,285 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:55,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:55,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:55,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:55,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:55,349 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:55,349 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:55,431 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:56:55,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:55,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:55,432 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:56:55,432 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:56:55,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:56:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:56:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-10-04 12:56:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:55,465 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:56:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:55,465 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:55,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:55,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:55,466 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:56:55,466 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:55,466 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:55,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1440464264, now seen corresponding path program 66 times [2018-10-04 12:56:55,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:55,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:55,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:55,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:55,552 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:55,560 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:55,576 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:56:55,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:55,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:55,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:55,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:55,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:55,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:55,623 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:55,623 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:56:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:55,696 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:56:55,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:55,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:55,697 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:56:55,697 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:56:55,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:56:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:56:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-04 12:56:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:55,736 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:55,736 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:55,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:55,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:55,736 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:55,737 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:55,737 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1440462342, now seen corresponding path program 67 times [2018-10-04 12:56:55,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:55,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:55,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:55,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:55,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:55,791 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:55,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:55,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:55,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:55,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:55,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:55,862 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:55,862 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:55,926 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-10-04 12:56:55,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:55,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:55,927 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:56:55,927 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 12:56:55,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:55,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 12:56:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-10-04 12:56:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:56:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:56:55,955 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 12:56:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:55,955 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:56:55,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:56:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:55,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:55,955 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:56:55,955 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:55,955 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1098654836, now seen corresponding path program 68 times [2018-10-04 12:56:55,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:55,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:56,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:56,021 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:56,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:56,036 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:56,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:56,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:56,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:56,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:56,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:56,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:56,099 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:56,099 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 9 states. [2018-10-04 12:56:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:56,212 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:56:56,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:56,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:56,213 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:56:56,213 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:56:56,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:56:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:56:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:56,256 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:56,257 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:56,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:56,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:56,257 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:56,257 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:56,257 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:56,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1098656758, now seen corresponding path program 69 times [2018-10-04 12:56:56,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:56,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:56,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:56,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:56,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:56,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:56,746 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:56,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:56,764 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:56:56,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:56,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:56,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:56,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:56,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:56,808 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:56,809 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:56,911 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:56:56,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:56,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:56,912 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:56:56,912 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:56:56,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 7 [2018-10-04 12:56:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:56:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:56:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:56,954 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:56:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:56,955 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:56,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:56,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:56,955 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:56,955 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:56,955 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:56,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1100501878, now seen corresponding path program 70 times [2018-10-04 12:56:56,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:56,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:56,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:56,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:56,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:57,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:57,008 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:57,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:57,022 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:57,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:57,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:57,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:57,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:57,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:57,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:57,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:57,072 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:56:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:57,171 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:56:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:57,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:57,172 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:56:57,172 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:56:57,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:56:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:56:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:57,217 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:57,218 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:57,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:57,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:57,218 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:56:57,218 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:57,218 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1100503800, now seen corresponding path program 71 times [2018-10-04 12:56:57,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:57,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:57,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:57,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:57,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:57,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:57,280 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:57,290 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:57,297 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:56:57,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:57,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:57,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:57,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:57,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:57,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:57,342 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:57,343 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:57,441 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:56:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:57,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:57,442 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:56:57,442 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:56:57,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:56:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-10-04 12:56:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:57,480 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:56:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:57,481 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:57,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:57,481 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:57,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:57,481 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:57,481 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:57,481 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:57,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1421305098, now seen corresponding path program 72 times [2018-10-04 12:56:57,481 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:57,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:57,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:57,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:57,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:57,552 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:57,560 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:56:57,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:57,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:57,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:57,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:57,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:57,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:57,618 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:57,618 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:56:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:57,723 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:56:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:57,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:57,724 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:56:57,724 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:56:57,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:56:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:56:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:57,769 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:57,769 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:57,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:57,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:57,770 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:56:57,770 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:57,770 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:57,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1421303176, now seen corresponding path program 73 times [2018-10-04 12:56:57,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:57,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:57,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:57,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:57,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:57,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:57,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:57,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:57,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:57,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:57,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:57,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:57,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:57,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:57,934 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:58,038 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:56:58,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:58,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:58,039 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:56:58,039 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:56:58,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:56:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:56:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:56:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:58,082 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:56:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:58,083 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:58,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:58,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:58,083 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:56:58,084 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:58,084 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1419458056, now seen corresponding path program 74 times [2018-10-04 12:56:58,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:58,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:58,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:58,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:58,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:58,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:58,160 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:58,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:58,181 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:58,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:58,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:58,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:58,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:58,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:58,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:58,225 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:58,225 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:56:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:58,330 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:56:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:58,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:58,331 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:56:58,331 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:56:58,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:56:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:56:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:58,377 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:58,377 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:58,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:58,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:58,378 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:58,378 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:58,378 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:58,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1419456134, now seen corresponding path program 75 times [2018-10-04 12:56:58,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:58,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:58,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:58,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:58,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:58,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:58,444 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:58,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:58,462 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:56:58,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:58,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:58,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:58,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:58,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:58,509 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:58,509 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:58,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:58,609 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:56:58,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:58,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:58,610 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:56:58,610 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:56:58,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:56:58,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-10-04 12:56:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:56:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:56:58,646 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 12:56:58,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:58,646 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:56:58,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:56:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:58,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:58,647 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:58,647 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:58,647 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:58,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1778713206, now seen corresponding path program 76 times [2018-10-04 12:56:58,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:58,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:58,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:58,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:58,706 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:58,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:58,721 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:58,722 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:58,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:58,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:58,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:58,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:58,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:58,785 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:58,785 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 12:56:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:58,901 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:56:58,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:58,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:58,903 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:56:58,903 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:56:58,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:56:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:56:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 12:56:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:58,966 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:58,966 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:58,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:58,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:58,966 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:56:58,967 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:58,967 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:58,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1778715128, now seen corresponding path program 77 times [2018-10-04 12:56:58,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:58,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:58,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:58,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:58,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:59,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:59,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:59,062 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:59,093 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:56:59,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:59,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:59,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:59,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:59,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:59,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:59,149 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:59,149 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:59,236 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:56:59,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:59,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:59,237 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:56:59,237 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:56:59,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:56:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:56:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 12:56:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:56:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:56:59,283 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:56:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:59,284 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:56:59,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:56:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:59,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:59,284 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:56:59,284 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:59,284 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:59,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1780560248, now seen corresponding path program 78 times [2018-10-04 12:56:59,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:59,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:59,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:59,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:59,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:59,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:59,351 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:59,367 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:56:59,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:59,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:59,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:59,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:59,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:59,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:59,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:59,432 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:56:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:59,531 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:56:59,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:59,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:59,532 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:56:59,532 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:56:59,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:56:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:56:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 12:56:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:56:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:56:59,599 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:56:59,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:59,599 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:56:59,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:56:59,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:59,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:59,600 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:56:59,600 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:59,600 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:59,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1780562170, now seen corresponding path program 79 times [2018-10-04 12:56:59,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:59,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:59,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:59,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:59,690 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:59,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:59,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:59,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:59,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:56:59,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:56:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:56:59,753 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:59,753 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:56:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:59,861 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:56:59,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:56:59,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:56:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:59,862 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:56:59,862 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:56:59,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:56:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:56:59,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-10-04 12:56:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:56:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:56:59,897 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:56:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:59,898 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:56:59,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:56:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:56:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:56:59,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:59,898 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:56:59,898 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:59,899 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:59,899 INFO L82 PathProgramCache]: Analyzing trace with hash -741246728, now seen corresponding path program 80 times [2018-10-04 12:56:59,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:59,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:59,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:59,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:59,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:59,960 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:59,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:59,975 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:59,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:59,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:00,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:00,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:00,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:00,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:00,024 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:00,024 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:57:00,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:00,115 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:57:00,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:00,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:00,116 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:57:00,116 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:57:00,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:57:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-10-04 12:57:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:00,164 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:57:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:00,164 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:00,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:00,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:00,164 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:00,164 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:00,164 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:00,165 INFO L82 PathProgramCache]: Analyzing trace with hash -741244806, now seen corresponding path program 81 times [2018-10-04 12:57:00,165 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:00,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:00,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:00,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:00,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:00,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:00,409 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:00,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:00,427 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:57:00,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:00,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:00,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:00,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:00,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:00,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:00,491 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:57:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:00,589 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:57:00,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:00,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:00,590 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:57:00,590 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:57:00,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 12:57:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:57:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-10-04 12:57:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:57:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:57:00,639 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:57:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:00,639 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:57:00,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:57:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:00,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:00,639 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:00,640 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:00,640 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash -739399686, now seen corresponding path program 82 times [2018-10-04 12:57:00,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:00,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:00,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:00,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:00,704 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:00,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:00,718 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:00,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:00,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:00,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:00,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:00,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:00,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:00,766 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:00,766 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:57:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:00,857 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:57:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:00,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:00,858 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:57:00,858 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:57:00,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:57:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-04 12:57:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:00,901 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:57:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:00,902 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:00,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:00,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:00,902 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:57:00,902 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:00,902 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:00,903 INFO L82 PathProgramCache]: Analyzing trace with hash -739397764, now seen corresponding path program 83 times [2018-10-04 12:57:00,903 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:00,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:00,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:00,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:01,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:01,046 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:01,054 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:01,061 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:57:01,062 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:01,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:01,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:01,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:01,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:01,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:01,106 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:01,106 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:57:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:01,184 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-10-04 12:57:01,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:01,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:01,185 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:57:01,185 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 12:57:01,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 12:57:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-10-04 12:57:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:57:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:57:01,215 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 12:57:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:01,215 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:57:01,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:57:01,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:01,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:01,216 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:57:01,216 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:01,216 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:01,216 INFO L82 PathProgramCache]: Analyzing trace with hash -189215756, now seen corresponding path program 84 times [2018-10-04 12:57:01,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:01,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:01,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:01,269 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:01,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:01,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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:01,280 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:01,286 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:57:01,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:01,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:01,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:01,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:01,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:01,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:01,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:01,351 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 9 states. [2018-10-04 12:57:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:01,503 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:01,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:01,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:01,504 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:01,504 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:01,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:57:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:01,561 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:01,561 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:01,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:01,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:01,562 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:01,562 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:01,563 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:01,563 INFO L82 PathProgramCache]: Analyzing trace with hash -189213834, now seen corresponding path program 85 times [2018-10-04 12:57:01,563 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:01,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:01,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:01,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:01,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:01,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:01,620 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:01,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:01,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:01,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:01,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:01,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:01,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:01,694 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:01,694 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:01,841 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:01,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:01,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:01,842 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:01,842 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:01,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 12:57:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:01,897 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:57:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:01,897 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:01,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:01,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:01,898 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:01,898 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:01,898 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:01,898 INFO L82 PathProgramCache]: Analyzing trace with hash -187368714, now seen corresponding path program 86 times [2018-10-04 12:57:01,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:01,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:01,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:01,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:01,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:01,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:01,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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:01,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:01,990 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:01,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:01,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:02,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:02,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:02,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:02,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:02,036 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:02,036 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:57:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:02,192 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:02,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:02,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:02,193 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:02,193 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:02,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:02,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:57:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:02,252 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:02,252 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:02,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:02,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:02,253 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:57:02,253 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:02,253 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:02,253 INFO L82 PathProgramCache]: Analyzing trace with hash -187366792, now seen corresponding path program 87 times [2018-10-04 12:57:02,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:02,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:02,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:02,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:02,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:02,304 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:02,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:02,322 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:57:02,322 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:02,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:02,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:02,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:02,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:02,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:02,383 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:02,383 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:02,582 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:02,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:02,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:02,583 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:02,583 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:02,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 12:57:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:57:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:57:02,662 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:57:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:02,663 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:57:02,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:57:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:02,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:02,663 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:02,664 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:02,664 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1585791606, now seen corresponding path program 88 times [2018-10-04 12:57:02,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:02,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:02,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:03,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:03,301 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:03,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:03,347 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:03,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:03,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:03,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:03,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:03,831 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:03,832 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:57:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:04,364 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:04,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:04,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:04,365 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:04,365 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:04,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.4s impTime 7 [2018-10-04 12:57:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:57:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:04,460 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:04,461 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:04,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:04,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:04,461 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:57:04,462 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:04,462 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:04,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1585793528, now seen corresponding path program 89 times [2018-10-04 12:57:04,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:04,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:04,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:04,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:04,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:04,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:04,600 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:04,608 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:04,615 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:57:04,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:04,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:04,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:04,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:04,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:04,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:04,659 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:04,659 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:04,837 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:04,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:04,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:04,838 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:04,838 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:04,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 12:57:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:04,893 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:57:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:04,893 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:04,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:04,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:04,893 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:57:04,894 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:04,894 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:04,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1587638648, now seen corresponding path program 90 times [2018-10-04 12:57:04,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:04,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:04,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:04,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:04,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:04,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:04,989 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:04,996 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:05,008 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:57:05,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:05,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:05,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:05,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:05,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:05,081 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:05,081 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:57:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:05,209 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:05,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:05,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:05,210 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:05,211 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:05,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 12:57:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:05,266 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:05,266 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:05,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:05,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:05,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:05,266 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:05,266 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:05,266 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:05,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1587640570, now seen corresponding path program 91 times [2018-10-04 12:57:05,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:05,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:05,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:05,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:05,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:05,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:05,390 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:05,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:05,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:05,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:05,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:05,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:05,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:05,466 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:05,467 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:05,587 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:05,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:05,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:05,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:05,588 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:05,588 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:05,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2018-10-04 12:57:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:57:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:57:05,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:57:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:05,632 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:57:05,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:57:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:05,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:05,632 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:05,633 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:05,633 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash 490842614, now seen corresponding path program 92 times [2018-10-04 12:57:05,633 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:05,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:05,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:05,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:05,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:05,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:05,766 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:05,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:05,778 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:05,778 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:05,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:05,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:05,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:05,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:05,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:05,821 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:05,821 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:57:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:06,002 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:06,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:06,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:06,003 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:06,003 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:06,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:57:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:06,064 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:06,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:06,064 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:06,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:06,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:06,064 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:57:06,065 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:06,065 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash 490844536, now seen corresponding path program 93 times [2018-10-04 12:57:06,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:06,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:06,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:06,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:06,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:06,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:06,117 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:06,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:06,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:57:06,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:06,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:06,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:06,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:06,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:06,186 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:06,186 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:06,364 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:06,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:06,365 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:06,365 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:06,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 12:57:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:06,456 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:57:06,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:06,457 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:06,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:06,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:06,457 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:57:06,458 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:06,458 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:06,458 INFO L82 PathProgramCache]: Analyzing trace with hash 492689656, now seen corresponding path program 94 times [2018-10-04 12:57:06,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:06,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:06,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:06,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:06,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:06,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:06,745 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:06,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:06,759 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:06,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:06,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:06,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:06,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:06,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:06,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:06,799 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:06,799 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:57:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:06,947 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:06,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:06,948 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:06,948 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:06,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 12:57:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:57:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:07,008 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:07,008 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:07,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:07,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:07,009 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:07,009 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:07,009 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash 492691578, now seen corresponding path program 95 times [2018-10-04 12:57:07,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:07,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:07,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:07,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:07,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:07,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:07,128 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:07,136 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:07,144 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:57:07,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:07,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:07,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:07,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:07,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:07,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:07,227 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:07,227 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:07,368 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:07,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:07,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:07,369 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:07,369 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:07,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 12:57:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:57:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:57:07,423 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:57:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:07,423 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:57:07,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:57:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:07,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:07,423 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:57:07,423 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:07,424 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:07,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2029117320, now seen corresponding path program 96 times [2018-10-04 12:57:07,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:07,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:07,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:07,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:07,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:08,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:08,104 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:08,113 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:08,121 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:57:08,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:08,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:08,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:08,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:08,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:08,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:08,164 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:08,164 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:57:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:08,299 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:08,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:08,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:08,300 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:08,300 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:08,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 7 [2018-10-04 12:57:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:08,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:57:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:08,362 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:08,362 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:08,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:08,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:08,363 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:08,363 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:08,363 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:08,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2029115398, now seen corresponding path program 97 times [2018-10-04 12:57:08,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:08,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:08,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:08,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:08,464 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:08,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:08,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:08,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:08,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:08,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:08,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:08,531 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:08,531 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:08,670 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:08,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:08,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:08,671 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:08,671 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:08,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 12:57:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:08,729 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:57:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:08,730 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:08,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:08,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:08,730 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:08,730 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:08,730 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:08,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2027270278, now seen corresponding path program 98 times [2018-10-04 12:57:08,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:08,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:08,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:08,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:08,794 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:08,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:08,807 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:08,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:08,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:08,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:08,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:08,865 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:08,865 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:57:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:08,999 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:09,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:09,000 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:09,000 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:09,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 12:57:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:09,063 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:09,063 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:09,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:09,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:09,064 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:57:09,064 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:09,064 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:09,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2027268356, now seen corresponding path program 99 times [2018-10-04 12:57:09,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:09,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:09,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:09,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:09,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:09,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:09,133 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:09,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:09,148 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:57:09,149 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:09,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:09,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:09,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:09,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:09,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:09,196 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:09,197 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:09,323 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:09,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:09,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:09,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:09,324 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:09,324 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:09,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 20. [2018-10-04 12:57:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:57:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:57:09,370 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 12:57:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:09,370 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:57:09,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:57:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:09,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:09,371 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:09,371 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:09,371 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash 511848822, now seen corresponding path program 100 times [2018-10-04 12:57:09,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:09,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:09,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:09,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:09,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:09,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:09,425 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:09,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:09,441 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:09,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:09,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:09,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:09,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:09,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:09,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:09,506 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:09,506 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 12:57:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:09,682 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:09,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:09,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:09,683 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:09,684 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:09,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 12:57:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:09,769 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:09,769 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:09,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:09,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:09,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:09,770 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:57:09,770 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:09,770 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:09,770 INFO L82 PathProgramCache]: Analyzing trace with hash 511850744, now seen corresponding path program 101 times [2018-10-04 12:57:09,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:09,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:09,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:09,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:09,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:09,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:09,824 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:09,834 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:09,844 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:57:09,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:09,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:09,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:09,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:09,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:09,904 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:09,904 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:10,043 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:10,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:10,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:10,044 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:10,044 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:10,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 12:57:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:10,116 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:57:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:10,116 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:10,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:10,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:10,117 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:57:10,117 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:10,117 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash 513695864, now seen corresponding path program 102 times [2018-10-04 12:57:10,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:10,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:10,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:10,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:10,175 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:10,183 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:10,190 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:57:10,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:10,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:10,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:10,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:10,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:10,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:10,255 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:10,255 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:57:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:10,391 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:10,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:10,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:10,392 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:10,392 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:10,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 12:57:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:10,469 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:10,470 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:10,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:10,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:10,470 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:10,470 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:10,470 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:10,470 INFO L82 PathProgramCache]: Analyzing trace with hash 513697786, now seen corresponding path program 103 times [2018-10-04 12:57:10,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:10,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:10,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:10,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:10,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:10,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:10,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:10,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:10,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:10,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:10,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:10,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:10,671 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:10,671 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:10,802 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:57:10,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:10,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:10,803 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:57:10,803 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:57:10,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:57:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 12:57:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:57:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:57:10,859 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:57:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:10,859 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:57:10,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:57:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:10,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:10,859 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:57:10,860 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:10,860 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:10,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2008111112, now seen corresponding path program 104 times [2018-10-04 12:57:10,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:10,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:10,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:10,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:10,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:10,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:10,938 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:10,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:10,951 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:10,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:10,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:10,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:10,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:10,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:10,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:10,998 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:10,998 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:57:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:11,145 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:11,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:11,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:11,146 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:11,146 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:11,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 12:57:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:11,215 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:11,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:11,215 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:11,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:11,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:11,215 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:11,215 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:11,216 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2008109190, now seen corresponding path program 105 times [2018-10-04 12:57:11,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:11,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:11,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:11,276 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:11,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:11,294 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:57:11,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:11,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:11,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:11,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:11,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:11,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:11,355 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:11,355 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:11,499 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:11,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:11,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:11,500 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:11,500 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:11,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 12:57:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:11,571 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:57:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:11,571 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:11,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:11,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:11,571 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:11,571 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:11,572 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2006264070, now seen corresponding path program 106 times [2018-10-04 12:57:11,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:11,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:11,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:11,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:11,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:11,648 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:11,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:11,662 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:11,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:11,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:11,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:11,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:11,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:11,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:11,711 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:11,711 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:57:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:11,854 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:11,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:11,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:11,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:11,855 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:11,855 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:11,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 12:57:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:11,927 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:11,927 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:11,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:11,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:11,928 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:57:11,928 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:11,928 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2006262148, now seen corresponding path program 107 times [2018-10-04 12:57:11,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:11,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:11,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:11,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:11,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:12,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:12,161 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:12,167 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:12,173 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:57:12,173 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:12,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:12,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:12,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:12,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:12,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:12,412 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:12,954 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:57:12,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:12,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:12,955 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:57:12,955 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:57:12,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 7 [2018-10-04 12:57:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:57:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 12:57:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:57:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:57:13,050 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:57:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:13,051 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:57:13,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:57:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:13,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:13,051 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:57:13,052 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:13,052 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:13,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1191907192, now seen corresponding path program 108 times [2018-10-04 12:57:13,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:13,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:13,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:13,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:13,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:13,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:13,569 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:13,576 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:13,587 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:57:13,587 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:13,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:13,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:13,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:13,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:13,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:13,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:13,639 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:57:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:13,768 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:57:13,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:13,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:13,769 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:57:13,769 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:57:13,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 7 [2018-10-04 12:57:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:57:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 12:57:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:13,880 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:13,880 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:13,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:13,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:13,881 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:13,881 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:13,882 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:13,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1191909114, now seen corresponding path program 109 times [2018-10-04 12:57:13,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:13,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:13,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:13,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:14,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:14,268 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:14,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:14,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:14,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:14,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:14,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:14,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:14,336 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:14,467 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:57:14,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:14,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:14,468 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:57:14,468 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:57:14,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 7 [2018-10-04 12:57:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:57:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 12:57:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:14,563 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:57:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:14,563 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:14,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:14,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:14,564 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:14,564 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:14,564 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1193754234, now seen corresponding path program 110 times [2018-10-04 12:57:14,564 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:14,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:14,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:14,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:14,661 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:14,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:14,676 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:14,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:14,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:14,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:14,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:14,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:14,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:14,746 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:14,746 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:57:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:14,891 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:57:14,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:14,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:14,892 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:57:14,892 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:57:14,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:57:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 12:57:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:14,964 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:14,964 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:14,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:14,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:14,964 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:57:14,964 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:14,965 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:14,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1193756156, now seen corresponding path program 111 times [2018-10-04 12:57:14,965 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:14,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:14,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:15,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:15,118 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:15,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:15,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:57:15,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:15,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:15,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:15,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:15,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:15,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:15,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:15,187 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:15,331 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:57:15,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:15,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:15,332 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:57:15,332 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:57:15,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:57:15,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 12:57:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:57:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:57:15,394 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:57:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:15,394 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:57:15,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:57:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:15,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:15,395 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:57:15,395 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:15,395 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:15,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1328052742, now seen corresponding path program 112 times [2018-10-04 12:57:15,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:15,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:15,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:15,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:15,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:15,444 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:15,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:15,445 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:15,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:15,457 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:15,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:15,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:15,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:15,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:15,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:15,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:15,516 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:15,516 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:57:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:15,631 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:57:15,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:15,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:15,632 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:57:15,632 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:57:15,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:57:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-10-04 12:57:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:15,707 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:15,707 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:15,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:15,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:15,707 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:57:15,708 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:15,708 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:15,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1328050820, now seen corresponding path program 113 times [2018-10-04 12:57:15,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:15,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:15,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:15,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:15,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:15,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:15,831 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:15,839 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:15,850 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:57:15,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:15,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:15,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:15,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:15,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:15,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:15,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:15,899 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:16,031 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:57:16,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:16,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:16,032 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:57:16,032 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:57:16,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:57:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:57:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-10-04 12:57:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:16,103 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:57:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:16,103 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:16,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:16,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:16,104 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:57:16,104 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:16,104 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:16,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1326205700, now seen corresponding path program 114 times [2018-10-04 12:57:16,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:16,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:16,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:16,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:16,164 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:16,172 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:16,181 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:57:16,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:16,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:16,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:16,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:16,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:16,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:16,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:16,241 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:57:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:16,358 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:57:16,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:16,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:16,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:16,358 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:57:16,358 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:57:16,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:57:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-10-04 12:57:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:16,436 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:57:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:16,436 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:16,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:57:16,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:16,437 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2018-10-04 12:57:16,437 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:16,437 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:16,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1326203778, now seen corresponding path program 6 times [2018-10-04 12:57:16,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:16,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:16,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:16,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:16,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:16,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:16,514 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:16,522 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:16,529 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:57:16,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:16,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:16,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:16,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:57:16,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:57:16,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:57:16,586 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:16,586 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:57:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:16,696 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2018-10-04 12:57:16,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:57:16,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:57:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:16,697 INFO L225 Difference]: With dead ends: 32 [2018-10-04 12:57:16,697 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:57:16,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 12:57:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:57:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-10-04 12:57:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:57:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:57:16,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 12:57:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:16,748 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:57:16,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:57:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:57:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:16,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:16,748 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2018-10-04 12:57:16,748 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:16,749 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash -168156555, now seen corresponding path program 7 times [2018-10-04 12:57:16,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:16,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:16,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:16,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:16,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:16,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:16,818 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:16,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:16,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:16,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:16,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:16,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:16,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:16,899 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2018-10-04 12:57:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:17,225 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:57:17,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:17,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:17,227 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:57:17,227 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:57:17,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:57:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:57:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:17,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:17,320 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:17,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:17,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:17,321 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:57:17,321 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:17,321 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:17,321 INFO L82 PathProgramCache]: Analyzing trace with hash -168154633, now seen corresponding path program 115 times [2018-10-04 12:57:17,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:17,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:17,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:17,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:17,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:17,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:17,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:17,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:17,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:17,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:17,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:17,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:17,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:17,462 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:17,661 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:17,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:17,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:17,662 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:17,662 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:17,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:57:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:17,784 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:17,784 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:17,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:17,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:17,785 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:57:17,785 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:17,785 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash -166309513, now seen corresponding path program 116 times [2018-10-04 12:57:17,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:17,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:17,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:17,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 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:17,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:17,961 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:17,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:17,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:18,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:18,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:18,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:18,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:18,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:18,007 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:18,215 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:57:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:18,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:18,216 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:57:18,216 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:57:18,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:57:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:57:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:18,315 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:18,315 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:18,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:18,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:18,315 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:18,315 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:18,315 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash -166307591, now seen corresponding path program 117 times [2018-10-04 12:57:18,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:18,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:18,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:18,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:18,392 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:18,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:18,408 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:18,408 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:18,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:18,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:18,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:18,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:18,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:18,456 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:18,456 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:18,661 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:18,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:18,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:18,662 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:18,662 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:18,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:57:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:18,749 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:57:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:18,749 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:18,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:18,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:18,750 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:57:18,750 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:18,750 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:18,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1606850807, now seen corresponding path program 118 times [2018-10-04 12:57:18,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:18,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:18,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:18,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:18,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:18,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:18,821 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:18,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:18,833 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:18,834 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:18,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:18,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:18,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:18,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:18,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:18,887 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:18,887 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:57:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:19,081 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:19,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:19,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:19,082 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:19,082 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:19,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:57:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:19,179 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:19,179 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:19,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:19,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:19,179 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:19,180 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:19,180 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1606852729, now seen corresponding path program 119 times [2018-10-04 12:57:19,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:19,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:19,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:19,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:19,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:19,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:19,292 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:19,299 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:19,308 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:19,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:19,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:19,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:19,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:19,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:19,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:19,353 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:19,353 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:19,549 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:19,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:19,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:19,550 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:19,550 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:19,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:57:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:19,647 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:19,647 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:19,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:19,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:19,647 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:19,648 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:19,648 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1608697849, now seen corresponding path program 120 times [2018-10-04 12:57:19,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:19,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:19,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:19,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:19,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:19,888 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:19,897 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:19,906 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:19,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:19,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:19,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:19,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:19,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:19,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:19,948 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:19,948 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:20,134 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:20,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:20,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:20,138 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:20,138 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:20,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 12:57:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:57:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:20,239 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:20,239 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:20,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:20,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:20,240 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:20,240 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:20,240 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1608699771, now seen corresponding path program 121 times [2018-10-04 12:57:20,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:20,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:20,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:20,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:20,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:20,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:20,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:20,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:20,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:20,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:20,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:20,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:20,361 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:20,361 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:20,542 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:20,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:20,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:20,543 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:20,543 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:20,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2018-10-04 12:57:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:57:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:57:20,622 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:57:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:20,622 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:57:20,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:57:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:20,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:20,623 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:57:20,623 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:20,623 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:20,623 INFO L82 PathProgramCache]: Analyzing trace with hash 511901815, now seen corresponding path program 122 times [2018-10-04 12:57:20,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:20,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:20,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:20,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:20,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:20,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:20,754 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:20,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:20,768 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:20,769 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:20,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:20,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:20,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:20,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:20,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:20,841 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:57:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:21,056 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:57:21,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:21,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:21,057 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:57:21,057 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:57:21,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:57:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:57:21,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:21,156 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:21,156 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:21,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:21,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:21,157 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:21,157 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:21,157 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash 511903737, now seen corresponding path program 123 times [2018-10-04 12:57:21,157 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:21,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:21,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:21,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:21,235 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:21,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:21,252 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:21,252 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:21,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:21,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:21,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:21,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:21,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:21,301 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:21,511 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:21,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:21,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:21,512 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:21,512 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:21,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:57:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:21,608 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:21,608 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:21,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:21,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:21,609 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:21,609 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:21,609 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:21,609 INFO L82 PathProgramCache]: Analyzing trace with hash 513748857, now seen corresponding path program 124 times [2018-10-04 12:57:21,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:21,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:21,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:21,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:21,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:21,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:21,672 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:21,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:21,685 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:21,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:21,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:21,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:21,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:21,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:21,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:21,738 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:21,738 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:21,964 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:57:21,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:21,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:21,965 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:57:21,965 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:57:21,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:57:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:57:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:22,064 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:22,064 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:22,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:22,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:22,065 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:22,065 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:22,065 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash 513750779, now seen corresponding path program 125 times [2018-10-04 12:57:22,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:22,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:22,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:22,133 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:22,142 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:22,151 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:22,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:22,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:22,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:22,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:22,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:22,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:22,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:22,220 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:22,425 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:22,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:22,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:22,426 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:22,426 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:22,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:57:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:22,528 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:57:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:22,528 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:22,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:22,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:22,529 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:22,529 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:22,529 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:22,529 INFO L82 PathProgramCache]: Analyzing trace with hash -2008058119, now seen corresponding path program 126 times [2018-10-04 12:57:22,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:22,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:22,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:22,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:22,648 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:22,656 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:22,666 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:22,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:22,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:22,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:22,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:22,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:22,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:22,779 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:22,779 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:57:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:22,983 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:22,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:22,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:22,984 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:22,984 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:22,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 8 [2018-10-04 12:57:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:57:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:23,079 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:23,079 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:23,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:23,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:23,080 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:23,080 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:23,080 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2008056197, now seen corresponding path program 127 times [2018-10-04 12:57:23,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:23,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:23,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:23,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:23,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:23,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:23,206 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:23,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:23,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:23,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:23,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:23,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:23,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:23,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:23,263 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:23,470 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:23,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:23,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:23,471 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:23,471 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:23,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:57:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:23,565 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:23,566 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:23,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:23,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:23,566 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:23,566 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:23,566 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2006211077, now seen corresponding path program 128 times [2018-10-04 12:57:23,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:23,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:23,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:23,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:23,733 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:23,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:23,747 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:23,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:23,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:23,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:23,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:23,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:23,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:23,792 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:23,792 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:23,992 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:23,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:23,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:23,994 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:23,994 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:23,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:57:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:24,099 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:24,099 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:24,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:24,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:24,100 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:24,100 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:24,100 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:24,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2006209155, now seen corresponding path program 129 times [2018-10-04 12:57:24,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:24,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:24,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:24,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:24,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:24,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:24,229 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:24,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:24,250 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:24,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:24,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:24,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:24,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:24,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:24,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:24,292 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:24,292 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:24,481 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:24,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:24,482 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:24,482 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:24,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2018-10-04 12:57:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:57:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:57:24,560 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 12:57:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:24,560 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:57:24,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:57:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:24,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:24,560 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:57:24,560 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:24,560 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:24,561 INFO L82 PathProgramCache]: Analyzing trace with hash 532908023, now seen corresponding path program 130 times [2018-10-04 12:57:24,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:24,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:24,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:24,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:24,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:24,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:24,627 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:24,643 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:24,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:24,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:24,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:24,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:24,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:24,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:24,694 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:24,694 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 12:57:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:24,900 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:24,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:24,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:24,901 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:24,901 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:24,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:57:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:25,008 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:25,008 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:25,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:25,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:25,009 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:25,009 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:25,009 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash 532909945, now seen corresponding path program 131 times [2018-10-04 12:57:25,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:25,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:25,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:25,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:25,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:25,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:25,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 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:25,084 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:25,095 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:25,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:25,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:25,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:25,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:25,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:25,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:25,160 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:25,161 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:25,363 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:25,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:25,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:25,364 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:25,364 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:25,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:57:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:25,468 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:25,468 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:25,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:25,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:25,468 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:25,468 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:25,468 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash 534755065, now seen corresponding path program 132 times [2018-10-04 12:57:25,469 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:25,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:25,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:25,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:25,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:25,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:25,534 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:25,542 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:25,551 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:25,552 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:25,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:25,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:25,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:25,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:25,618 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:25,619 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:25,824 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:25,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:25,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:25,825 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:25,825 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:25,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:57:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:25,927 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:25,927 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:25,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:25,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:25,928 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:25,928 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:25,928 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash 534756987, now seen corresponding path program 133 times [2018-10-04 12:57:25,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:25,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:25,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:26,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:26,041 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:26,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:26,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:26,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:26,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:26,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:26,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:26,122 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:26,122 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:26,301 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:26,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:26,302 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:26,302 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:26,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:57:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:26,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:57:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:26,402 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:26,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:26,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:26,402 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:26,403 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:26,403 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:26,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1987051911, now seen corresponding path program 134 times [2018-10-04 12:57:26,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:26,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:26,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:26,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:26,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:26,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:26,473 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:26,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:26,488 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:26,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:26,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:26,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:26,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:26,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:26,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:26,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:26,536 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:57:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:26,769 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:26,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:26,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:26,770 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:26,770 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:26,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:57:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:26,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:26,882 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:26,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:26,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:26,882 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:26,883 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:26,883 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:26,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1987049989, now seen corresponding path program 135 times [2018-10-04 12:57:26,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:26,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:26,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:26,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:26,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:26,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:26,951 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:26,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:26,967 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:26,968 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:26,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:27,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:27,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:27,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:27,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:27,021 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:27,246 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:27,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:27,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:27,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:27,247 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:27,247 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:27,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:57:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:27,356 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:27,356 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:27,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:27,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:27,356 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:27,357 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:27,357 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:27,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1985204869, now seen corresponding path program 136 times [2018-10-04 12:57:27,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:27,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:27,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:27,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:27,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:27,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:27,445 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:27,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:27,462 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:27,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:27,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:27,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:27,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:27,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:27,515 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:27,515 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:27,714 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:27,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:27,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:27,715 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:27,715 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:27,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:57:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:27,835 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:27,835 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:27,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:27,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:27,836 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:27,836 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:27,836 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1985202947, now seen corresponding path program 137 times [2018-10-04 12:57:27,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:27,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:27,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:27,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:27,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:27,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:27,903 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:27,911 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:27,920 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:27,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:27,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:27,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:27,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:27,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:27,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:27,986 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:27,986 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:28,172 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:28,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:28,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:28,173 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:28,173 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:28,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:57:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:57:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:57:28,264 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:57:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:28,264 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:57:28,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:57:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:28,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:28,265 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:28,265 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:28,265 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1212966393, now seen corresponding path program 138 times [2018-10-04 12:57:28,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:28,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:28,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:28,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:28,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:28,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:28,343 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:28,350 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:28,358 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:28,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:28,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:28,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:28,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:28,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:28,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:28,412 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:28,412 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:57:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:28,594 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:28,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:28,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:28,595 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:28,595 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:28,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 12:57:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:28,711 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:28,711 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:28,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:28,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:28,712 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:28,712 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:28,712 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:28,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1212968315, now seen corresponding path program 139 times [2018-10-04 12:57:28,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:28,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:28,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:28,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:28,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:28,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:28,797 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:28,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:28,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:28,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:28,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:28,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:28,877 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:28,877 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:29,060 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:57:29,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:29,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:29,061 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:57:29,061 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:57:29,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:57:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 12:57:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:29,176 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:29,176 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:29,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:29,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:29,176 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:29,177 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:29,177 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:29,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1214813435, now seen corresponding path program 140 times [2018-10-04 12:57:29,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:29,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:29,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:29,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:29,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:29,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:29,241 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:29,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:29,269 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:29,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:29,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:29,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:29,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:29,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:29,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:29,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:29,325 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:29,532 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:29,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:29,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:29,533 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:29,533 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:29,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 12:57:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:29,651 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:29,651 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:29,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:29,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:29,652 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:29,652 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:29,652 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:29,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1214815357, now seen corresponding path program 141 times [2018-10-04 12:57:29,652 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:29,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:29,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:29,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:29,717 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:29,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:29,733 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:29,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:29,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:29,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:29,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:29,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:29,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:29,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:29,798 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:30,000 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:57:30,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:30,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:30,001 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:57:30,001 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:57:30,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:57:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:57:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:30,111 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:57:30,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:30,112 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:30,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:30,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:30,112 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:30,112 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:30,112 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1306993541, now seen corresponding path program 142 times [2018-10-04 12:57:30,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:30,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:30,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:30,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:30,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:30,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:30,175 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:30,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:30,189 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:30,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:30,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:30,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:30,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:30,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:30,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:30,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:30,248 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:57:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:30,432 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:57:30,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:30,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:30,433 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:57:30,433 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:57:30,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:57:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-10-04 12:57:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:30,548 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:30,548 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:30,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:30,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:30,549 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:30,549 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:30,549 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1306991619, now seen corresponding path program 143 times [2018-10-04 12:57:30,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:30,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:30,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:30,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:30,612 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:30,619 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:30,628 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:30,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:30,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:30,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:30,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:30,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:30,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:30,691 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:30,691 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:30,867 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:57:30,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:30,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:30,868 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:57:30,868 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:57:30,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:57:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-10-04 12:57:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:30,974 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:30,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:30,974 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:30,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:30,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:30,974 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:30,974 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:30,975 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:30,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1305146499, now seen corresponding path program 144 times [2018-10-04 12:57:30,975 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:30,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:30,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:30,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:30,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:31,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:31,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:31,102 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:31,113 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:31,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:31,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:31,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:31,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:31,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:31,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:31,188 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:31,188 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:31,363 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:57:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:31,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:31,364 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:57:31,364 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:57:31,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:57:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-10-04 12:57:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:31,476 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:31,476 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:31,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:31,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:31,477 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:31,477 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:31,477 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1305144577, now seen corresponding path program 145 times [2018-10-04 12:57:31,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:31,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:31,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:31,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:31,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:31,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:31,548 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:31,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:31,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:31,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:31,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:31,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:31,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:31,632 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:31,632 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:31,783 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2018-10-04 12:57:31,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:31,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:31,784 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:57:31,784 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:57:31,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:57:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-10-04 12:57:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:57:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:57:31,859 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 12:57:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:31,860 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:57:31,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:31,860 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:57:31,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:31,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:31,860 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:57:31,860 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:31,860 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:31,860 INFO L82 PathProgramCache]: Analyzing trace with hash -754962569, now seen corresponding path program 146 times [2018-10-04 12:57:31,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:31,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:31,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:31,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:31,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:31,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:31,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:31,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:31,944 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:31,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:31,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:32,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:32,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:32,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:32,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:32,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:32,042 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 10 states. [2018-10-04 12:57:32,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:32,308 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:57:32,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:32,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:32,309 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:57:32,309 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:57:32,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:57:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:57:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:32,433 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:32,434 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:32,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:32,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:32,434 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:32,434 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:32,434 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash -754960647, now seen corresponding path program 147 times [2018-10-04 12:57:32,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:32,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:32,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:32,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:32,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:32,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:32,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:32,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:32,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:32,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:32,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:32,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:32,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:32,581 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:32,581 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:32,836 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:32,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:32,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:32,837 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:32,837 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:32,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:57:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:32,966 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:32,966 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:32,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:32,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:32,967 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:32,967 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:32,967 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash -753115527, now seen corresponding path program 148 times [2018-10-04 12:57:32,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:32,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:32,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:33,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:33,023 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:33,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:33,038 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:33,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:33,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:33,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:33,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:33,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:33,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:33,101 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:33,101 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:33,376 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:57:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:33,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:33,377 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:57:33,377 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:57:33,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:57:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:57:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:33,497 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:33,497 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:33,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:33,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:33,497 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:33,497 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:33,497 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash -753113605, now seen corresponding path program 149 times [2018-10-04 12:57:33,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:33,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:33,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:33,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:33,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:33,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:33,596 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:33,604 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:33,613 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:33,613 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:33,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:33,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:33,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:33,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:33,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:33,664 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:33,664 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:33,920 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:33,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:33,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:33,921 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:33,921 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:33,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:33,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:57:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:34,042 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:57:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:34,042 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:34,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:34,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:34,042 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:34,043 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:34,043 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1020044793, now seen corresponding path program 150 times [2018-10-04 12:57:34,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:34,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:34,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:34,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:34,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:34,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:34,108 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:34,115 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:34,124 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:34,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:34,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:34,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:34,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:34,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:34,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:34,187 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:57:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:34,429 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:34,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:34,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:34,430 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:34,430 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:34,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:34,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:57:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:34,557 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:34,557 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:34,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:34,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:34,558 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:34,558 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:34,558 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1020046715, now seen corresponding path program 151 times [2018-10-04 12:57:34,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:34,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:34,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:34,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:34,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:34,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:34,626 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:34,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:34,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:34,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:34,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:34,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:34,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:34,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:34,704 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:34,966 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:34,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:34,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:34,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:34,967 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:34,967 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:34,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:57:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:35,092 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:35,093 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:35,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:35,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:35,093 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:35,093 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:35,093 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:35,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1021891835, now seen corresponding path program 152 times [2018-10-04 12:57:35,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:35,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:35,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:35,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:35,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:35,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:35,161 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:35,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:35,174 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:35,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:35,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:35,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:35,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:35,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:35,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:35,239 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:35,240 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:35,464 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:35,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:35,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:35,465 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:35,465 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:35,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:57:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:35,600 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:35,600 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:35,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:35,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:35,601 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:35,601 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:35,601 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1021893757, now seen corresponding path program 153 times [2018-10-04 12:57:35,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:35,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:35,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:35,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:35,670 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:35,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:35,688 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:35,688 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:35,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:35,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:35,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:35,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:35,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:35,741 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:35,741 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:35,957 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:35,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:35,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:35,958 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:35,958 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:35,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2018-10-04 12:57:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:57:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:57:36,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:57:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:36,068 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:57:36,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:57:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:36,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:36,068 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:36,068 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:36,068 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash -74904199, now seen corresponding path program 154 times [2018-10-04 12:57:36,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:36,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:36,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:36,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:36,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:36,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:36,152 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:36,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:36,184 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:36,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:36,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:36,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:36,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:36,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:36,266 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:36,266 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:57:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:36,537 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:57:36,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:36,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:36,538 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:57:36,538 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:57:36,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:57:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:57:36,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:36,664 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:36,664 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:36,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:36,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:36,665 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:36,665 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:36,665 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash -74902277, now seen corresponding path program 155 times [2018-10-04 12:57:36,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:36,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:36,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:37,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:37,015 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:37,031 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:37,130 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:37,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:37,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:37,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:37,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:37,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:37,437 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:37,437 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:37,689 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:37,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:37,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:37,690 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:37,690 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:37,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 8 [2018-10-04 12:57:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:37,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:57:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:37,819 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:37,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:37,819 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:37,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:37,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:37,819 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:37,819 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:37,820 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:37,820 INFO L82 PathProgramCache]: Analyzing trace with hash -73057157, now seen corresponding path program 156 times [2018-10-04 12:57:37,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:37,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:37,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:37,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:37,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:37,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:37,908 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:37,916 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:37,925 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:37,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:37,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:37,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:37,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:37,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:37,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:37,988 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:37,988 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:38,265 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:57:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:38,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:38,266 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:57:38,266 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:57:38,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:57:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:57:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:38,395 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:38,395 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:38,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:38,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:38,395 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:38,395 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:38,396 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:38,396 INFO L82 PathProgramCache]: Analyzing trace with hash -73055235, now seen corresponding path program 157 times [2018-10-04 12:57:38,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:38,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:38,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:38,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:38,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:38,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:38,466 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:38,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:38,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:38,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:38,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:38,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:38,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:38,548 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:38,548 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:38,807 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:57:38,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:38,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:38,808 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:57:38,808 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:57:38,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:57:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:57:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:38,918 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:57:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:38,918 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:38,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:38,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:38,919 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:38,919 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:38,919 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1700103163, now seen corresponding path program 158 times [2018-10-04 12:57:38,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:38,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:38,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:38,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:38,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:38,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:38,987 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:38,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:39,002 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:39,003 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:39,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:39,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:39,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:39,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:39,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:39,056 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:39,056 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:57:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:39,310 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:39,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:39,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:39,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:39,311 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:39,311 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:39,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:39,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:57:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:39,463 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:39,464 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:39,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:39,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:39,464 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:39,464 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:39,464 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:39,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1700105085, now seen corresponding path program 159 times [2018-10-04 12:57:39,464 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:39,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:39,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:39,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:39,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:39,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:39,533 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:39,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:39,548 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:39,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:39,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:39,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:39,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:39,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:39,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:39,617 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:39,617 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:39,863 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:57:39,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:39,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:39,864 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:57:39,864 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:57:39,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:57:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:57:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:39,986 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:39,986 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:39,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:39,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:39,987 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:39,987 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:39,987 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:39,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1701950205, now seen corresponding path program 160 times [2018-10-04 12:57:39,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:39,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:39,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:39,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:40,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:40,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:40,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:40,069 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:40,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:40,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:40,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:40,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:40,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:40,126 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:40,126 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:40,369 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:40,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:40,370 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:40,370 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:40,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:57:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:40,507 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:40,507 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:40,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:40,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:40,507 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:40,508 INFO L423 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:40,508 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1701952127, now seen corresponding path program 161 times [2018-10-04 12:57:40,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:40,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:40,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:40,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:40,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:40,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:40,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:40,611 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:40,635 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:40,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:40,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:40,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:40,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:40,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:40,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:40,680 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:40,680 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:41,032 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:41,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:41,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:41,033 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:41,033 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:41,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2018-10-04 12:57:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:57:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:57:41,126 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 12:57:41,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:41,126 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:57:41,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:57:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:41,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:41,126 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:41,127 INFO L423 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:41,127 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:41,127 INFO L82 PathProgramCache]: Analyzing trace with hash -53897991, now seen corresponding path program 162 times [2018-10-04 12:57:41,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:41,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:41,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:41,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:41,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:41,246 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:41,270 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:41,270 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:41,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:41,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:41,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:41,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:41,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:41,337 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:41,337 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 12:57:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:41,581 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:41,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:41,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:41,582 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:41,582 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:41,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:57:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:41,725 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:41,725 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:41,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:41,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:41,726 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:41,726 INFO L423 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:41,726 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:41,726 INFO L82 PathProgramCache]: Analyzing trace with hash -53896069, now seen corresponding path program 163 times [2018-10-04 12:57:41,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:41,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:41,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:41,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:41,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:41,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:41,796 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:41,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:41,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:41,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:41,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:41,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:41,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:41,923 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:41,923 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:42,299 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:42,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:42,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:42,300 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:42,300 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:42,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:57:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:42,439 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:42,440 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:42,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:42,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:42,440 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:42,440 INFO L423 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:42,440 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -52050949, now seen corresponding path program 164 times [2018-10-04 12:57:42,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:42,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:42,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:42,520 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:42,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:42,536 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:42,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:42,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:42,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:42,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:42,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:42,603 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:42,603 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:42,851 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:42,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:42,852 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:42,852 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:42,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:57:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:42,997 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:42,997 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:42,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:42,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:42,998 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:42,998 INFO L423 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:42,998 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash -52049027, now seen corresponding path program 165 times [2018-10-04 12:57:42,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:42,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:42,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:43,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:43,061 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:43,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:43,077 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:43,077 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:43,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:43,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:43,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:43,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:43,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:43,132 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:43,132 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:43,359 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:43,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:43,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:43,360 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:43,360 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:43,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:57:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:43,489 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:57:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:43,489 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:43,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:43,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:43,490 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:43,490 INFO L423 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:43,490 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1721109371, now seen corresponding path program 166 times [2018-10-04 12:57:43,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:43,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:43,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:43,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:43,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:43,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:43,560 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:43,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:43,573 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:43,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:43,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:43,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:43,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:43,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:43,643 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:43,643 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:57:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:43,893 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:43,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:43,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:43,894 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:43,894 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:43,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:57:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:44,042 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:44,042 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:44,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:44,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:44,042 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:44,043 INFO L423 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:44,043 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:44,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1721111293, now seen corresponding path program 167 times [2018-10-04 12:57:44,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:44,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:44,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:44,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:44,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:44,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:44,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:44,121 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:44,129 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:44,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:44,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:44,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:44,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:44,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:44,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:44,184 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:44,184 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:44,437 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:57:44,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:44,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:44,438 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:57:44,438 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:57:44,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:57:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:57:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:44,576 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:44,576 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:44,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:44,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:44,577 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:44,577 INFO L423 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:44,577 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1722956413, now seen corresponding path program 168 times [2018-10-04 12:57:44,577 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:44,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:44,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:44,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:44,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:44,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:44,643 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:44,650 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:44,659 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:44,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:44,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:44,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:44,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:44,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:44,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:44,723 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:44,723 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:44,963 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:57:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:44,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:44,964 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:57:44,964 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:57:44,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:57:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:57:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:45,103 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:45,103 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:45,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:45,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:45,103 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:45,104 INFO L423 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:45,104 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:45,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1722958335, now seen corresponding path program 169 times [2018-10-04 12:57:45,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:45,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:45,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:45,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:45,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:45,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:45,159 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:45,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:45,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:45,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:45,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:45,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:45,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:45,222 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:45,222 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:45,448 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:45,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:45,449 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:45,449 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:45,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:57:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:57:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:57:45,569 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:57:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:45,569 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:57:45,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:57:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:45,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:45,570 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:45,570 INFO L423 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:45,570 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash 626160379, now seen corresponding path program 170 times [2018-10-04 12:57:45,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:45,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:45,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:45,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:45,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:45,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:45,630 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:45,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:45,643 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:45,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:45,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:45,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:45,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:45,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:45,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:45,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:45,697 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:57:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:45,933 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:45,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:45,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:45,934 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:45,934 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:45,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 12:57:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:46,083 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:46,083 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:46,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:46,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:46,083 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:46,084 INFO L423 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:46,084 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:46,084 INFO L82 PathProgramCache]: Analyzing trace with hash 626162301, now seen corresponding path program 171 times [2018-10-04 12:57:46,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:46,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:46,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:46,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:46,160 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:46,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:46,176 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:46,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:46,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:46,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:46,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:46,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:46,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:46,227 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:46,227 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:46,440 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:57:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:46,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:46,440 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:57:46,440 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:57:46,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:57:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 12:57:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:46,576 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:46,576 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:46,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:46,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:46,577 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:46,577 INFO L423 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:46,577 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:46,577 INFO L82 PathProgramCache]: Analyzing trace with hash 628007421, now seen corresponding path program 172 times [2018-10-04 12:57:46,577 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:46,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:46,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:46,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:46,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:46,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:46,655 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:46,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:46,667 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:46,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:46,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:46,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:46,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:46,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:46,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:46,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:46,743 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:46,973 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:57:46,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:46,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:46,974 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:57:46,974 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:57:46,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:57:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 12:57:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:47,120 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:47,120 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:47,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:47,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:47,121 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:47,121 INFO L423 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:47,121 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:47,121 INFO L82 PathProgramCache]: Analyzing trace with hash 628009343, now seen corresponding path program 173 times [2018-10-04 12:57:47,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:47,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:47,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:47,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:47,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:47,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:47,426 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:47,434 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:47,442 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:47,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:47,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:47,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:47,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:47,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:47,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:47,486 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:47,486 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:47,694 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:57:47,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:47,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:47,695 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:57:47,695 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:57:47,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 8 [2018-10-04 12:57:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:57:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:57:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:47,831 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:57:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:47,832 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:47,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:47,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:47,832 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:47,832 INFO L423 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:47,832 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:47,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1893799555, now seen corresponding path program 174 times [2018-10-04 12:57:47,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:47,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:47,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:47,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:47,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:47,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:47,921 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:47,928 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:48,000 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:48,001 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:48,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:48,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:48,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:48,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:48,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:48,255 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:48,255 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:57:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:48,510 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:57:48,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:48,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:48,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:48,511 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:57:48,511 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:57:48,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 8 [2018-10-04 12:57:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:57:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-10-04 12:57:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:48,652 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:48,652 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:48,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:48,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:48,652 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:48,653 INFO L423 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:48,653 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1893797633, now seen corresponding path program 175 times [2018-10-04 12:57:48,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:48,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:48,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:48,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:48,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:48,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:48,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:48,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:48,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:48,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:48,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:48,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:48,781 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:48,985 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:57:48,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:48,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:48,986 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:57:48,986 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:57:48,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:57:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-10-04 12:57:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:49,132 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:49,132 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:49,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:49,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:49,132 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:49,133 INFO L423 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:49,133 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1891952513, now seen corresponding path program 176 times [2018-10-04 12:57:49,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:49,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:49,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:49,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:49,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:49,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:49,193 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:49,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:49,210 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:49,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:49,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:49,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:49,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:49,266 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:49,266 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:49,466 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:57:49,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:49,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:49,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:49,467 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:57:49,467 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:57:49,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:57:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-10-04 12:57:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:49,622 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:49,622 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:49,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:49,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:49,622 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:57:49,622 INFO L423 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:49,623 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1891950591, now seen corresponding path program 177 times [2018-10-04 12:57:49,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:49,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:49,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:49,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:49,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:49,687 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:49,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:49,704 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:49,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:49,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:49,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:49,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:49,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:49,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:49,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:49,759 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:49,934 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2018-10-04 12:57:49,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:49,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:49,940 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:57:49,940 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:57:49,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:57:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-10-04 12:57:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:57:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:57:50,027 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 12:57:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:50,027 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:57:50,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:57:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:50,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:50,027 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:57:50,027 INFO L423 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:50,027 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1448020233, now seen corresponding path program 178 times [2018-10-04 12:57:50,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:50,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:50,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:50,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:50,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:50,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:50,090 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:50,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:50,112 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:50,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:50,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:50,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:50,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:50,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:50,174 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:50,174 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 10 states. [2018-10-04 12:57:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:50,548 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:57:50,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:50,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:50,549 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:57:50,549 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:57:50,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:57:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 12:57:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:57:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:57:50,723 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:57:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:50,723 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:57:50,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:57:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:50,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:50,724 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:50,724 INFO L423 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:50,724 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:50,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1448018311, now seen corresponding path program 179 times [2018-10-04 12:57:50,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:50,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:50,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:50,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:50,795 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:50,804 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:50,815 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:50,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:50,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:50,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:50,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:50,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:50,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:50,877 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:50,877 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:57:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:51,272 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:57:51,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:51,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:51,273 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:57:51,273 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:57:51,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:57:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 12:57:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:51,450 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:51,450 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:51,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:51,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:51,450 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:51,451 INFO L423 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:51,451 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:51,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1446173191, now seen corresponding path program 180 times [2018-10-04 12:57:51,451 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:51,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:51,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:51,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:51,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:51,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:51,551 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:51,558 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:51,567 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:51,567 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:51,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:51,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:51,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:51,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:51,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:51,661 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:51,661 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:52,030 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:57:52,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:52,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:52,031 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:57:52,031 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:57:52,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:52,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:57:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 12:57:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:57:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:57:52,235 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:57:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:52,235 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:57:52,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:57:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:52,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:52,235 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:52,235 INFO L423 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:52,236 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:52,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1446171269, now seen corresponding path program 181 times [2018-10-04 12:57:52,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:52,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:52,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:52,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:52,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:52,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:52,345 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:52,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:52,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:52,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:52,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:52,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:52,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:52,412 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:52,412 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:57:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:52,777 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:57:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:52,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:52,779 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:57:52,779 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:57:52,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:57:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2018-10-04 12:57:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:52,936 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:52,937 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:52,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:52,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:52,937 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:52,937 INFO L423 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:52,937 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash 326987129, now seen corresponding path program 182 times [2018-10-04 12:57:52,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:52,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:52,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:52,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:52,996 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:53,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:53,011 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:53,011 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:53,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:53,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:53,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:53,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:53,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:53,073 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:53,073 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:53,479 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:57:53,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:53,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:53,480 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:57:53,480 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:57:53,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:57:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 12:57:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:57:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:57:53,649 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:57:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:53,649 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:57:53,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:57:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:53,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:53,649 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:53,649 INFO L423 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:53,650 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash 326989051, now seen corresponding path program 183 times [2018-10-04 12:57:53,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:53,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:53,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:53,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:53,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:53,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:53,722 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:53,739 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:53,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:53,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:53,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:53,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:53,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:53,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:53,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:53,790 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:57:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:54,190 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:57:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:54,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:54,191 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:57:54,191 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:57:54,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:57:54,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:57:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 12:57:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:54,365 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:54,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:54,365 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:54,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:54,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:54,365 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:54,365 INFO L423 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:54,366 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:54,366 INFO L82 PathProgramCache]: Analyzing trace with hash 328834171, now seen corresponding path program 184 times [2018-10-04 12:57:54,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:54,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:54,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:54,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:54,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:54,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:54,431 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:54,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:54,469 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:54,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:54,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:54,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:54,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:54,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:54,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:54,788 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:54,788 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:55,161 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:57:55,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:55,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:55,162 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:57:55,162 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:57:55,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 8 [2018-10-04 12:57:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:57:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 12:57:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:57:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:57:55,339 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:57:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:55,339 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:57:55,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:57:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:55,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:55,340 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:55,340 INFO L423 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:55,340 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:55,340 INFO L82 PathProgramCache]: Analyzing trace with hash 328836093, now seen corresponding path program 185 times [2018-10-04 12:57:55,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:55,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:55,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:55,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:55,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:55,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:55,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:55,488 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:55,496 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:55,497 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:55,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:55,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:55,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:55,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:55,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:55,548 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:55,548 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:57:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:55,980 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:57:55,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:55,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:55,981 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:57:55,981 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:57:55,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:57:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 26. [2018-10-04 12:57:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:57:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:57:56,134 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:57:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:56,134 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:57:56,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:57:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:56,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:56,134 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:57:56,135 INFO L423 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:56,135 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:56,135 INFO L82 PathProgramCache]: Analyzing trace with hash -767961863, now seen corresponding path program 186 times [2018-10-04 12:57:56,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:56,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:56,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:56,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:56,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:56,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:56,203 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:56,211 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:56,220 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:57:56,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:56,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:56,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:56,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:56,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:56,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:56,285 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:56,285 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:57:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:56,663 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:57:56,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:56,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:56,664 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:57:56,664 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:57:56,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:57:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:57:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:57:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:57:56,845 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:57:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:56,845 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:57:56,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:57:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:56,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:56,845 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:56,845 INFO L423 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:56,845 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:56,846 INFO L82 PathProgramCache]: Analyzing trace with hash -767959941, now seen corresponding path program 187 times [2018-10-04 12:57:56,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:56,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:56,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:56,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:56,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:56,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:56,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 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:56,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:56,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:57,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:57,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:57,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:57,017 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:57,017 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:57:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:57,467 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:57:57,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:57,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:57,468 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:57:57,468 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:57:57,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:57:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 12:57:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:57:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:57:57,638 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:57:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:57,638 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:57:57,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:57:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:57,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:57,638 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:57,638 INFO L423 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:57,639 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash -766114821, now seen corresponding path program 188 times [2018-10-04 12:57:57,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:57,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:57,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:57,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:57,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:57,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:57,751 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:57,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:57,765 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:57,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:57,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:57,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:57,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:57,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:57,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:57,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:57,813 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:57:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:58,185 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:57:58,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:58,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:58,186 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:57:58,186 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:57:58,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:57:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:57:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:57:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:57:58,362 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:57:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:58,362 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:57:58,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:57:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:58,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:58,363 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:58,363 INFO L423 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:58,363 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash -766112899, now seen corresponding path program 189 times [2018-10-04 12:57:58,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:58,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:58,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:58,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:58,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:58,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:58,427 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:58,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:58,444 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:57:58,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:58,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:58,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:58,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:58,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:58,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:58,515 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:58,515 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:57:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:59,069 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:57:59,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:59,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:59,070 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:57:59,070 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:57:59,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:57:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-10-04 12:57:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:57:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:57:59,238 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:57:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:59,238 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:57:59,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:57:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:59,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:59,238 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:59,239 INFO L423 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:59,239 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:59,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1007045499, now seen corresponding path program 190 times [2018-10-04 12:57:59,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:59,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:59,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:59,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:59,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:59,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:59,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:59,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:59,345 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:59,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:59,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:59,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:59,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:57:59,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:57:59,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:57:59,388 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:59,388 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:57:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:59,729 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:57:59,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:57:59,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:57:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:59,730 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:57:59,730 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:57:59,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:57:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:57:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 12:57:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:57:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:57:59,917 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:57:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:59,917 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:57:59,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:57:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:57:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:57:59,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:59,918 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:57:59,918 INFO L423 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:59,918 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1007047421, now seen corresponding path program 191 times [2018-10-04 12:57:59,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:59,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:59,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:59,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:59,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:59,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:59,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:59,982 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:59,991 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:57:59,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:59,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:00,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:00,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:00,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:00,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:00,050 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:00,050 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:00,381 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:58:00,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:00,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:00,382 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:58:00,382 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:58:00,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:58:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:58:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:00,561 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:00,561 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:00,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:00,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:00,562 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:00,562 INFO L423 AbstractCegarLoop]: === Iteration 206 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:00,562 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1008892541, now seen corresponding path program 192 times [2018-10-04 12:58:00,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:00,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:00,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:00,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:00,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:00,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:00,635 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:00,643 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:00,651 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:58:00,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:00,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:00,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:00,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:00,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:00,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:00,711 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:00,711 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:01,030 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:58:01,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:01,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:01,031 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:58:01,031 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:58:01,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:58:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:58:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:01,237 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:01,237 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:01,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:01,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:01,238 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:01,238 INFO L423 AbstractCegarLoop]: === Iteration 207 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:01,238 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:01,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1008894463, now seen corresponding path program 193 times [2018-10-04 12:58:01,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:01,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:01,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:01,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:01,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:01,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:01,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:01,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:01,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:01,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:01,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:01,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:01,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:01,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:01,359 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:01,669 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:58:01,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:01,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:01,670 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:58:01,670 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:58:01,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:58:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 12:58:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:58:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:58:01,800 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:58:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:01,800 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:58:01,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:58:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:01,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:01,801 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:01,801 INFO L423 AbstractCegarLoop]: === Iteration 208 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:01,801 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash -746955655, now seen corresponding path program 194 times [2018-10-04 12:58:01,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:01,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:01,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:01,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:01,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:01,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:01,927 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:01,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:01,939 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:01,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:01,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:02,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:02,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:02,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:02,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:02,009 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:02,009 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:58:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:02,439 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:58:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:02,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:02,440 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:58:02,440 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:58:02,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:02,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:58:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 12:58:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:02,628 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:02,629 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:02,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:02,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:02,629 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:02,629 INFO L423 AbstractCegarLoop]: === Iteration 209 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:02,629 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash -746953733, now seen corresponding path program 195 times [2018-10-04 12:58:02,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:02,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:02,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:02,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:02,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:02,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:02,695 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:02,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:02,712 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:58:02,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:02,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:02,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:02,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:02,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:02,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:02,763 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:02,764 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:03,177 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:58:03,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:03,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:03,178 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:58:03,178 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:58:03,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:58:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 12:58:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:03,361 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:03,361 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:03,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:03,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:03,361 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:03,361 INFO L423 AbstractCegarLoop]: === Iteration 210 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:03,361 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:03,361 INFO L82 PathProgramCache]: Analyzing trace with hash -745108613, now seen corresponding path program 196 times [2018-10-04 12:58:03,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:03,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:03,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:03,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:03,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:03,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:03,430 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:03,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:03,443 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:03,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:03,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:03,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:03,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:03,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:03,493 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:03,493 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:03,898 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:58:03,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:03,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:03,899 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:58:03,899 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:58:03,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:58:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 12:58:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:04,093 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:04,093 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:04,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:04,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:04,093 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:04,093 INFO L423 AbstractCegarLoop]: === Iteration 211 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:04,094 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash -745106691, now seen corresponding path program 197 times [2018-10-04 12:58:04,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:04,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:04,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:04,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:04,157 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:04,165 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:04,174 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:58:04,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:04,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:04,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:04,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:04,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:04,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:04,226 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:04,226 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:04,614 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:58:04,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:04,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:04,615 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:58:04,615 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:58:04,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:58:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2018-10-04 12:58:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:58:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:58:04,795 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:58:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:04,795 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:58:04,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:58:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:04,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:04,796 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:04,796 INFO L423 AbstractCegarLoop]: === Iteration 212 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:04,796 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:04,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1028051707, now seen corresponding path program 198 times [2018-10-04 12:58:04,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:04,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:04,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:04,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:04,864 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:04,871 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:04,879 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:58:04,879 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:04,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:04,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:04,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:04,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:04,931 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:04,931 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:58:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:05,357 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:58:05,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:05,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:05,358 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:58:05,358 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:58:05,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:58:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 12:58:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:05,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:05,547 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:05,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:05,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:05,547 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:05,547 INFO L423 AbstractCegarLoop]: === Iteration 213 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:05,547 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:05,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1028053629, now seen corresponding path program 199 times [2018-10-04 12:58:05,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:05,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:05,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:05,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:05,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:05,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:05,607 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:05,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:05,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:05,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:05,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:05,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:05,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:05,690 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:06,149 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:58:06,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:06,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:06,150 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:58:06,150 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:58:06,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:58:06,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 12:58:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:06,331 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:06,331 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:06,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:06,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:06,332 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:06,332 INFO L423 AbstractCegarLoop]: === Iteration 214 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:06,332 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:06,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1029898749, now seen corresponding path program 200 times [2018-10-04 12:58:06,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:06,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:06,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:06,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:06,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:06,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:06,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 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:06,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:06,424 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:06,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:06,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:06,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:06,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:06,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:06,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:06,472 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:06,472 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:06,880 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:58:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:06,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:06,881 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:58:06,881 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:58:06,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:58:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 12:58:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:07,076 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:07,076 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:07,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:07,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:07,077 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:07,077 INFO L423 AbstractCegarLoop]: === Iteration 215 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:07,077 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1029900671, now seen corresponding path program 201 times [2018-10-04 12:58:07,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:07,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:07,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:07,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:07,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:07,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:07,177 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:07,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:07,192 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:58:07,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:07,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:07,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:07,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:07,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:07,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:07,244 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:07,244 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:07,641 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:58:07,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:07,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:07,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:07,642 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:58:07,642 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:58:07,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:58:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 26. [2018-10-04 12:58:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:58:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:58:07,810 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:58:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:07,810 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:58:07,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:58:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:07,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:07,810 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:07,810 INFO L423 AbstractCegarLoop]: === Iteration 216 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:07,811 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:07,811 INFO L82 PathProgramCache]: Analyzing trace with hash -66897285, now seen corresponding path program 202 times [2018-10-04 12:58:07,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:07,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:07,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:07,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:07,883 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:07,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:07,897 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:07,897 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:07,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:07,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:07,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:07,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:07,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:07,964 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:58:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:08,356 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:58:08,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:08,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:08,357 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:58:08,357 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:58:08,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:58:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:58:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:08,557 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:08,557 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:08,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:08,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:08,557 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:08,558 INFO L423 AbstractCegarLoop]: === Iteration 217 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:08,558 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:08,558 INFO L82 PathProgramCache]: Analyzing trace with hash -66895363, now seen corresponding path program 203 times [2018-10-04 12:58:08,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:08,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:08,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:08,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:08,627 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:08,635 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:08,646 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:58:08,646 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:08,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:08,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:08,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:08,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:08,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:08,699 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:08,699 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:09,087 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:58:09,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:09,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:09,088 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:58:09,088 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:58:09,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:58:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 12:58:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:09,272 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:09,272 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:09,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:09,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:09,273 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:09,273 INFO L423 AbstractCegarLoop]: === Iteration 218 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:09,273 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash -65050243, now seen corresponding path program 204 times [2018-10-04 12:58:09,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:09,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:09,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:09,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:09,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 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:09,528 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:09,541 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:58:09,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:09,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:09,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:09,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:09,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:09,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:09,595 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:09,595 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:09,990 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:58:09,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:09,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:09,991 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:58:09,991 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:58:09,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 12:58:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:58:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:58:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:10,194 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:10,194 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:10,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:10,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:10,194 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:10,195 INFO L423 AbstractCegarLoop]: === Iteration 219 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:10,195 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash -65048321, now seen corresponding path program 205 times [2018-10-04 12:58:10,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:10,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:10,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:10,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:10,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:10,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:10,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:10,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:10,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:10,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:10,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:10,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:10,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:10,349 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:10,349 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:10,727 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:58:10,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:10,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:10,728 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:58:10,728 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:58:10,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:58:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-10-04 12:58:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:58:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:58:10,909 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:58:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:10,909 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:58:10,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:58:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:10,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:10,909 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:10,910 INFO L423 AbstractCegarLoop]: === Iteration 220 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:10,910 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1708110077, now seen corresponding path program 206 times [2018-10-04 12:58:10,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:10,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:10,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:10,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:10,977 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:10,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:10,991 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:10,992 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:10,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:11,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:11,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:11,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:11,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:11,054 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:11,054 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:58:11,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:11,394 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:58:11,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:11,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:11,395 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:58:11,395 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:58:11,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:11,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:58:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 12:58:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:11,585 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:11,585 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:11,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:11,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:11,586 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:11,586 INFO L423 AbstractCegarLoop]: === Iteration 221 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:11,586 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:11,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1708111999, now seen corresponding path program 207 times [2018-10-04 12:58:11,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:11,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:11,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:11,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:11,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:11,675 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:11,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:11,694 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:58:11,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:11,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:11,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:11,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:11,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:11,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:11,739 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:11,739 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:12,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:12,098 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:58:12,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:12,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:12,099 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:58:12,099 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:58:12,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:58:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:58:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:12,285 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:12,285 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:12,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:12,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:12,286 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:12,286 INFO L423 AbstractCegarLoop]: === Iteration 222 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:12,286 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1709957119, now seen corresponding path program 208 times [2018-10-04 12:58:12,286 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:12,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:12,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:12,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:12,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:12,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:12,373 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:12,373 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:12,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:12,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:12,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:12,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:12,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:12,465 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:12,465 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:12,804 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:58:12,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:12,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:12,805 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:58:12,805 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:58:12,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:58:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:58:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:12,997 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:12,997 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:12,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:12,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:12,998 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:58:12,998 INFO L423 AbstractCegarLoop]: === Iteration 223 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:12,998 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:12,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1709959041, now seen corresponding path program 209 times [2018-10-04 12:58:12,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:12,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:12,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:12,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:12,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:13,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:13,065 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:13,073 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:13,082 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:58:13,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:13,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:13,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:13,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:13,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:13,137 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:13,137 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:13,468 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:58:13,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:13,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:13,469 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:58:13,469 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:58:13,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:58:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 22. [2018-10-04 12:58:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:58:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:58:13,600 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 12:58:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:13,600 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:58:13,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:58:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:13,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:13,600 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:13,601 INFO L423 AbstractCegarLoop]: === Iteration 224 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:13,601 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:13,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2034826247, now seen corresponding path program 210 times [2018-10-04 12:58:13,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:13,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:13,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:13,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:13,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:13,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:13,659 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:13,667 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:13,683 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:58:13,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:13,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:13,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:13,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:13,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:13,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:13,752 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:13,752 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 12:58:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:14,161 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:58:14,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:14,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:14,162 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:58:14,162 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:58:14,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:14,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:58:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:58:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:14,385 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:14,385 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:14,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:14,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:14,385 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:14,385 INFO L423 AbstractCegarLoop]: === Iteration 225 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:14,386 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:14,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2034824325, now seen corresponding path program 211 times [2018-10-04 12:58:14,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:14,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:14,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:14,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:14,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:14,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:14,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:14,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:14,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:14,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:14,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:14,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:14,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:14,510 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:14,511 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:14,904 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:58:14,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:14,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:14,905 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:58:14,905 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:58:14,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:58:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:58:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:15,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:15,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:15,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:15,111 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:15,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:15,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:15,111 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:15,111 INFO L423 AbstractCegarLoop]: === Iteration 226 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:15,111 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2032979205, now seen corresponding path program 212 times [2018-10-04 12:58:15,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:15,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:15,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:15,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:15,184 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:15,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:15,197 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:15,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:15,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:15,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:15,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:15,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:15,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:15,260 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:15,260 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:15,680 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:58:15,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:15,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:15,681 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:58:15,681 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:58:15,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:58:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:58:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:15,900 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:15,900 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:15,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:15,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:15,901 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:15,901 INFO L423 AbstractCegarLoop]: === Iteration 227 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:15,901 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:15,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2032977283, now seen corresponding path program 213 times [2018-10-04 12:58:15,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:15,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:15,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:15,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:15,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:15,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:15,971 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:15,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:15,987 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:58:15,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:15,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:16,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:16,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:16,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:16,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:16,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:16,042 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:16,437 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:58:16,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:16,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:16,438 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:58:16,438 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:58:16,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:58:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2018-10-04 12:58:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:58:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:58:16,628 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:58:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:16,628 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:58:16,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:58:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:16,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:16,629 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:16,629 INFO L423 AbstractCegarLoop]: === Iteration 228 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:16,629 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:16,629 INFO L82 PathProgramCache]: Analyzing trace with hash -259818885, now seen corresponding path program 214 times [2018-10-04 12:58:16,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:16,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:16,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:16,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:16,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:16,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:16,686 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:16,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:16,701 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:16,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:16,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:16,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:16,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:16,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:16,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:16,918 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:16,918 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:58:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:17,270 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:58:17,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:17,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:17,271 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:58:17,271 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:58:17,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 8 [2018-10-04 12:58:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:58:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:58:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:17,497 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:17,497 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:17,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:17,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:17,498 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:17,498 INFO L423 AbstractCegarLoop]: === Iteration 229 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:17,498 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash -259816963, now seen corresponding path program 215 times [2018-10-04 12:58:17,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:17,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:17,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:17,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:17,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:17,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:17,565 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:17,572 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:17,581 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:58:17,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:17,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:17,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:17,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:17,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:17,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:17,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:17,647 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:18,022 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:58:18,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:18,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:18,023 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:58:18,023 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:58:18,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:58:18,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 12:58:18,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:18,230 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:18,230 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:18,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:18,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:18,230 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:18,230 INFO L423 AbstractCegarLoop]: === Iteration 230 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:18,230 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash -257971843, now seen corresponding path program 216 times [2018-10-04 12:58:18,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:18,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:18,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:18,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:18,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:18,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:18,291 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:18,298 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:18,306 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:58:18,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:18,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:18,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:18,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:18,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:18,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:18,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:18,373 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:18,725 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:58:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:18,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:18,726 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:58:18,726 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:58:18,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:58:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 12:58:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:18,948 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:18,948 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:18,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:18,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:18,948 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:18,948 INFO L423 AbstractCegarLoop]: === Iteration 231 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:18,949 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash -257969921, now seen corresponding path program 217 times [2018-10-04 12:58:18,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:18,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:18,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:18,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:18,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:19,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:19,032 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:19,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:19,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:19,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:19,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:19,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:19,116 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:19,116 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:19,583 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:58:19,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:19,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:19,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:19,584 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:58:19,584 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:58:19,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:58:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 12:58:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:58:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:58:19,760 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:58:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:19,760 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:58:19,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:58:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:19,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:19,761 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:19,761 INFO L423 AbstractCegarLoop]: === Iteration 232 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:19,761 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1354767877, now seen corresponding path program 218 times [2018-10-04 12:58:19,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:19,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:19,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:19,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:19,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 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:19,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:19,833 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:19,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:19,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:19,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:19,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:19,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:19,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:19,894 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:19,894 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:58:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:20,377 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:58:20,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:20,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:20,378 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:58:20,378 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:58:20,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:58:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:58:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:20,620 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:20,620 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:20,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:20,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:20,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:20,620 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:20,621 INFO L423 AbstractCegarLoop]: === Iteration 233 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:20,621 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:20,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1354765955, now seen corresponding path program 219 times [2018-10-04 12:58:20,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:20,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:20,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:20,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:20,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:20,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:20,697 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:20,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:20,714 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:58:20,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:20,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:21,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:21,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:21,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:21,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:21,255 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:21,255 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:22,329 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:58:22,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:22,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:22,330 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:58:22,330 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:58:22,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.0s impTime 8 [2018-10-04 12:58:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:58:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:58:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:22,564 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:22,565 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:22,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:22,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:22,565 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:22,565 INFO L423 AbstractCegarLoop]: === Iteration 234 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:22,565 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:22,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1352920835, now seen corresponding path program 220 times [2018-10-04 12:58:22,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:22,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:22,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:22,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:22,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:22,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:22,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:22,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:22,653 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:22,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:22,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:22,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:22,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:22,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:22,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:22,718 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:22,718 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:23,150 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:58:23,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:23,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:23,151 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:58:23,151 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:58:23,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:23,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:58:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:58:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:23,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:23,368 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:23,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:23,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:23,369 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:23,369 INFO L423 AbstractCegarLoop]: === Iteration 235 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:23,369 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1352918913, now seen corresponding path program 221 times [2018-10-04 12:58:23,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:23,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:23,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:23,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:23,436 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:23,444 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:23,452 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:58:23,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:23,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:23,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:23,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:23,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:23,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:23,506 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:23,506 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:23,931 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:58:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:23,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:23,932 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:58:23,932 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:58:23,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:58:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2018-10-04 12:58:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:58:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:58:24,134 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:58:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:24,135 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:58:24,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:58:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:24,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:24,135 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:24,135 INFO L423 AbstractCegarLoop]: === Iteration 236 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:24,135 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:24,135 INFO L82 PathProgramCache]: Analyzing trace with hash 420239485, now seen corresponding path program 222 times [2018-10-04 12:58:24,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:24,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:24,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:24,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:24,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:24,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:24,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:24,776 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:24,788 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:58:24,789 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:24,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:24,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:24,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:24,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:24,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:24,833 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:24,833 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:58:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:25,229 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:58:25,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:25,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:25,230 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:58:25,230 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:58:25,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 8 [2018-10-04 12:58:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:58:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:58:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:25,464 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:25,465 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:25,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:25,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:25,465 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:25,465 INFO L423 AbstractCegarLoop]: === Iteration 237 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:25,465 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash 420241407, now seen corresponding path program 223 times [2018-10-04 12:58:25,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:25,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:25,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:25,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:25,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:25,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:25,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:25,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:25,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:25,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:25,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:25,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:25,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:25,620 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:25,620 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:26,013 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:58:26,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:26,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:26,014 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:58:26,014 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:58:26,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:58:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 12:58:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:26,233 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:26,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:26,233 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:26,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:26,233 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:26,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:26,233 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:26,233 INFO L423 AbstractCegarLoop]: === Iteration 238 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:26,233 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash 422086527, now seen corresponding path program 224 times [2018-10-04 12:58:26,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:26,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:26,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:26,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:26,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:26,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:26,305 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:26,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:26,319 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:26,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:26,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:26,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:26,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:26,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:26,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:26,367 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:26,367 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:26,733 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:58:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:26,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:26,734 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:58:26,734 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:58:26,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:58:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 12:58:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:26,956 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:26,956 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:26,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:26,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:26,956 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:58:26,957 INFO L423 AbstractCegarLoop]: === Iteration 239 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:26,957 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:26,957 INFO L82 PathProgramCache]: Analyzing trace with hash 422088449, now seen corresponding path program 225 times [2018-10-04 12:58:26,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:26,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:26,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:26,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:26,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:27,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:27,020 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:27,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:27,036 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:58:27,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:27,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:27,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:27,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:27,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:27,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:27,085 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:27,085 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:27,424 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:58:27,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:27,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:27,425 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:58:27,425 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:58:27,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:58:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 24. [2018-10-04 12:58:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:58:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:58:27,582 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:58:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:27,582 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:58:27,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:58:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:27,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:27,583 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:27,583 INFO L423 AbstractCegarLoop]: === Iteration 240 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:27,583 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:27,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1333761669, now seen corresponding path program 226 times [2018-10-04 12:58:27,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:27,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:27,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:27,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:27,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:27,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:27,669 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:27,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:27,682 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:27,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:27,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:27,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:27,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:27,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:27,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:27,726 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:27,726 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:58:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:28,104 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:58:28,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:28,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:28,105 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:58:28,105 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:58:28,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:58:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 12:58:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:28,342 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:28,342 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:28,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:28,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:28,343 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:28,343 INFO L423 AbstractCegarLoop]: === Iteration 241 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:28,343 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1333759747, now seen corresponding path program 227 times [2018-10-04 12:58:28,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:28,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:28,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:28,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:28,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:28,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:28,412 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:28,421 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:58:28,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:28,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:28,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:28,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:28,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:28,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:28,473 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:28,473 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:28,861 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:58:28,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:28,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:28,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:28,862 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:58:28,862 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:58:28,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:58:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:58:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:29,074 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:29,074 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:29,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:29,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:29,074 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:29,075 INFO L423 AbstractCegarLoop]: === Iteration 242 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:29,075 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:29,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1331914627, now seen corresponding path program 228 times [2018-10-04 12:58:29,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:29,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:29,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:29,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:29,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 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:29,138 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:29,146 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:58:29,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:29,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:29,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:29,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:29,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:29,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:29,213 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:29,213 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:29,580 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:58:29,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:29,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:29,581 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:58:29,581 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:58:29,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:58:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-10-04 12:58:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:29,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:29,808 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:29,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:29,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:29,808 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:29,808 INFO L423 AbstractCegarLoop]: === Iteration 243 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:29,809 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1331912705, now seen corresponding path program 229 times [2018-10-04 12:58:29,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:29,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:29,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:29,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:29,877 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:29,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:29,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:29,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:29,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:29,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:29,957 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:29,957 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:30,343 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:58:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:30,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:30,344 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:58:30,344 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:58:30,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:58:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 12:58:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:58:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:58:30,549 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:58:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:30,549 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:58:30,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:58:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:30,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:30,549 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:30,549 INFO L423 AbstractCegarLoop]: === Iteration 244 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:30,549 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:30,550 INFO L82 PathProgramCache]: Analyzing trace with hash 441245693, now seen corresponding path program 230 times [2018-10-04 12:58:30,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:30,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:30,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:30,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:30,618 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:30,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:30,632 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:30,632 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:30,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:30,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:30,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:30,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:30,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:30,687 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:30,687 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:58:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:31,076 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:58:31,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:31,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:31,077 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:58:31,077 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:58:31,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:58:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 12:58:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:31,317 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:31,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:31,317 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:31,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:31,317 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:31,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:31,317 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:31,317 INFO L423 AbstractCegarLoop]: === Iteration 245 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:31,317 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:31,318 INFO L82 PathProgramCache]: Analyzing trace with hash 441247615, now seen corresponding path program 231 times [2018-10-04 12:58:31,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:31,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:31,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:31,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:31,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:31,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 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:31,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:31,404 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:58:31,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:31,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:31,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:31,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:31,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:31,592 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:31,592 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:31,987 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:58:31,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:31,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:31,988 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:58:31,988 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:58:31,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 8 [2018-10-04 12:58:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:58:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:58:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:32,218 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:32,218 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:32,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:32,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:32,219 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:32,219 INFO L423 AbstractCegarLoop]: === Iteration 246 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:32,219 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:32,219 INFO L82 PathProgramCache]: Analyzing trace with hash 443092735, now seen corresponding path program 232 times [2018-10-04 12:58:32,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:32,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:32,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:32,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:32,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:32,289 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:32,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:32,290 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:32,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:32,305 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:32,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:32,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:32,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:32,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:32,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:32,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:32,370 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:32,370 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:32,732 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:58:32,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:32,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:32,733 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:58:32,733 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:58:32,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:58:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-10-04 12:58:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:32,967 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:32,968 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:32,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:32,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:32,968 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:58:32,968 INFO L423 AbstractCegarLoop]: === Iteration 247 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:32,968 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash 443094657, now seen corresponding path program 233 times [2018-10-04 12:58:32,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:32,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:32,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:33,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:33,038 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:33,046 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:33,055 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:58:33,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:33,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:33,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:33,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:33,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:33,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:33,109 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:33,110 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:33,447 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:58:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:33,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:33,448 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:58:33,448 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:58:33,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:58:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 12:58:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:58:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:58:33,635 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:58:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:33,636 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:58:33,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:58:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:33,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:33,636 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:58:33,636 INFO L423 AbstractCegarLoop]: === Iteration 248 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:33,636 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash -653703299, now seen corresponding path program 234 times [2018-10-04 12:58:33,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:33,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:33,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:33,711 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:33,720 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:33,729 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:58:33,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:33,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:33,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:33,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:33,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:33,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:33,778 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:33,779 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:58:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:34,127 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:58:34,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:34,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:34,128 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:58:34,128 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:58:34,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:58:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 12:58:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:34,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:34,367 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:34,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:34,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:34,368 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:34,368 INFO L423 AbstractCegarLoop]: === Iteration 249 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:34,368 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:34,368 INFO L82 PathProgramCache]: Analyzing trace with hash -653701377, now seen corresponding path program 235 times [2018-10-04 12:58:34,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:34,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:34,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:34,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:34,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:34,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:34,424 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:34,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:34,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:34,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:34,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:34,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:34,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:34,493 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:34,493 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:34,830 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:58:34,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:34,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:34,831 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:58:34,831 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:58:34,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:58:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 12:58:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:35,062 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:35,062 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:35,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:35,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:35,062 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:35,062 INFO L423 AbstractCegarLoop]: === Iteration 250 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:35,063 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash -651856257, now seen corresponding path program 236 times [2018-10-04 12:58:35,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:35,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:35,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:35,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:35,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:35,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:35,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:35,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:35,161 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:35,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:35,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:35,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:35,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:35,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:35,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:35,222 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:35,222 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:35,582 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:58:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:35,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:35,583 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:58:35,583 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:58:35,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:58:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 12:58:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:35,815 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:35,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:35,815 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:35,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:35,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:35,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:35,816 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:58:35,816 INFO L423 AbstractCegarLoop]: === Iteration 251 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:35,816 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash -651854335, now seen corresponding path program 237 times [2018-10-04 12:58:35,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:35,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:35,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:35,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:35,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:35,887 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:35,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:35,903 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:58:35,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:35,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:35,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:35,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:35,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:35,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:35,956 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:35,957 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:36,292 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:58:36,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:36,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:36,293 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:58:36,293 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:58:36,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:58:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 12:58:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:58:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:58:36,507 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:58:36,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:36,507 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:58:36,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:58:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:36,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:36,507 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:58:36,507 INFO L423 AbstractCegarLoop]: === Iteration 252 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:36,507 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1121304063, now seen corresponding path program 238 times [2018-10-04 12:58:36,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:36,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:36,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:36,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:36,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:36,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:36,577 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:36,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:36,591 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:36,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:36,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:36,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:36,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:36,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:36,637 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:36,637 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:58:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:36,945 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:58:36,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:36,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:36,946 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:58:36,946 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:58:36,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:58:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-10-04 12:58:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:37,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:37,198 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:37,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:37,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:37,199 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:58:37,199 INFO L423 AbstractCegarLoop]: === Iteration 253 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:37,199 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1121305985, now seen corresponding path program 239 times [2018-10-04 12:58:37,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:37,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:37,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:37,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:37,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:37,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:37,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 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:37,279 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:37,288 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:58:37,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:37,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:37,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:37,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:37,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:37,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:37,350 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:37,350 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:37,667 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:58:37,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:37,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:37,668 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:58:37,668 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:58:37,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:58:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:58:37,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-10-04 12:58:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:37,899 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:58:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:37,899 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:37,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:37,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:37,900 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:58:37,900 INFO L423 AbstractCegarLoop]: === Iteration 254 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:37,900 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:37,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1123151105, now seen corresponding path program 240 times [2018-10-04 12:58:37,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:37,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:37,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:37,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:37,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:37,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:37,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:37,974 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:37,983 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:58:37,983 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:37,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:38,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:38,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:38,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:38,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:38,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:38,032 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:58:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:38,341 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:58:38,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:38,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:38,342 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:58:38,342 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:58:38,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:38,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:58:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-04 12:58:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:38,577 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:58:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:38,578 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:38,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:58:38,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:38,578 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2018-10-04 12:58:38,578 INFO L423 AbstractCegarLoop]: === Iteration 255 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:38,578 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:38,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1123153027, now seen corresponding path program 7 times [2018-10-04 12:58:38,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:38,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:38,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:38,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:38,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:38,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:38,653 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:38,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:38,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:38,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:38,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:58:38,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:58:38,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:58:38,719 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:38,720 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:58:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:39,013 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2018-10-04 12:58:39,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:58:39,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:58:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:39,014 INFO L225 Difference]: With dead ends: 36 [2018-10-04 12:58:39,014 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:58:39,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 12:58:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:58:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-10-04 12:58:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:58:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:58:39,160 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 12:58:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:39,160 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:58:39,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:58:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:58:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:39,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:39,161 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2018-10-04 12:58:39,161 INFO L423 AbstractCegarLoop]: === Iteration 256 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:39,161 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1610002744, now seen corresponding path program 8 times [2018-10-04 12:58:39,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:39,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:39,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:39,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:39,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:39,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:39,237 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:39,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:39,263 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:39,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:39,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:39,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:39,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:39,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:39,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:39,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:39,323 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2018-10-04 12:58:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:39,939 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:58:39,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:39,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:39,941 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:58:39,941 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:58:39,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:58:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:58:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:58:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:58:40,250 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:58:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:40,250 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:58:40,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:58:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:40,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:40,251 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:58:40,251 INFO L423 AbstractCegarLoop]: === Iteration 257 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:40,251 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1610004666, now seen corresponding path program 241 times [2018-10-04 12:58:40,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:40,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:40,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:40,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:40,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:40,336 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:40,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:40,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:40,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:40,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:40,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:40,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:40,416 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:40,417 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:58:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:41,013 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:58:41,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:41,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:41,014 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:58:41,014 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:58:41,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:58:41,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:58:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:41,290 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:58:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:41,291 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:41,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:41,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:41,291 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:58:41,291 INFO L423 AbstractCegarLoop]: === Iteration 258 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:41,291 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1611849786, now seen corresponding path program 242 times [2018-10-04 12:58:41,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:41,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:41,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:41,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:41,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:41,390 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:41,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:41,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:41,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:41,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:41,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:41,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:41,456 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:41,456 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:58:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:42,050 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:58:42,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:42,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:42,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:42,051 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:58:42,051 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:58:42,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:58:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:58:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:58:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:58:42,337 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:58:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:42,337 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:58:42,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:58:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:42,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:42,337 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:58:42,337 INFO L423 AbstractCegarLoop]: === Iteration 259 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:42,337 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:42,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1611851708, now seen corresponding path program 243 times [2018-10-04 12:58:42,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:42,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:42,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:42,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:42,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:42,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:42,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:42,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:42,424 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:58:42,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:42,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:42,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:42,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:42,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:42,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:42,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:42,489 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:58:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:43,033 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:58:43,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:43,034 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:43,034 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:58:43,034 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:58:43,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:58:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 12:58:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:43,293 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:58:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:43,293 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:43,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:43,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:43,293 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:58:43,294 INFO L423 AbstractCegarLoop]: === Iteration 260 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:43,294 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash -909957190, now seen corresponding path program 244 times [2018-10-04 12:58:43,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:43,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:43,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:43,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:43,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:43,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:43,372 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:43,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:43,386 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:43,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:43,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:43,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:43,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:43,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:43,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:43,441 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:43,441 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:58:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:44,049 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:58:44,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:44,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:44,050 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:58:44,050 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:58:44,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:58:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:58:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:58:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:58:44,336 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:58:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:44,336 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:58:44,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:58:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:44,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:44,337 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:58:44,337 INFO L423 AbstractCegarLoop]: === Iteration 261 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:44,337 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:44,337 INFO L82 PathProgramCache]: Analyzing trace with hash -909955268, now seen corresponding path program 245 times [2018-10-04 12:58:44,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:44,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:44,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:44,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:44,406 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:44,414 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:44,423 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:58:44,423 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:44,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:44,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:44,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:44,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:44,492 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:44,492 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:58:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:45,118 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:58:45,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:45,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:45,119 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:58:45,119 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:58:45,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:58:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:58:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:45,411 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:58:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:45,411 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:45,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:45,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:45,411 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:58:45,411 INFO L423 AbstractCegarLoop]: === Iteration 262 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:45,411 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:45,412 INFO L82 PathProgramCache]: Analyzing trace with hash -908110148, now seen corresponding path program 246 times [2018-10-04 12:58:45,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:45,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:45,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:45,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:45,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:45,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:45,488 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:45,497 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:45,507 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:58:45,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:45,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:45,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:45,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:45,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:45,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:45,576 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:45,576 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:58:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:46,165 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:58:46,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:46,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:46,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:46,166 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:58:46,166 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:58:46,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:46,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:58:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:58:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:58:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:58:46,454 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:58:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:46,454 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:58:46,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:58:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:46,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:46,454 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:58:46,455 INFO L423 AbstractCegarLoop]: === Iteration 263 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:46,455 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash -908108226, now seen corresponding path program 247 times [2018-10-04 12:58:46,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:46,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:46,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:46,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:46,527 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:46,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:46,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:46,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:46,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:46,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:46,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:46,622 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:46,622 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:58:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:47,170 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:58:47,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:47,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:47,171 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:58:47,171 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:58:47,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:58:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 12:58:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:58:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:58:47,412 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:58:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:47,412 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:58:47,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:58:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:47,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:47,413 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:58:47,413 INFO L423 AbstractCegarLoop]: === Iteration 264 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:47,413 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2004906182, now seen corresponding path program 248 times [2018-10-04 12:58:47,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:47,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:47,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:47,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:47,492 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:47,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:47,508 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:47,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:47,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:47,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:47,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:47,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:47,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:47,572 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:47,572 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:58:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:48,125 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:58:48,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:48,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:48,126 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:58:48,126 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:58:48,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:58:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:58:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:58:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:58:48,422 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:58:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:48,422 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:58:48,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:58:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:48,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:48,423 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:58:48,423 INFO L423 AbstractCegarLoop]: === Iteration 265 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:48,423 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2004904260, now seen corresponding path program 249 times [2018-10-04 12:58:48,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:48,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:48,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:48,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:48,508 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:48,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:48,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:58:48,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:48,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:48,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:48,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:48,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:48,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:48,632 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:48,632 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:58:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:49,166 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:58:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:49,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:49,167 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:58:49,167 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:58:49,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:58:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:58:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:49,453 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:58:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:49,454 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:49,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:49,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:49,454 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:58:49,454 INFO L423 AbstractCegarLoop]: === Iteration 266 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:49,454 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:49,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2003059140, now seen corresponding path program 250 times [2018-10-04 12:58:49,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:49,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:49,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:49,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:49,528 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:49,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:49,543 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:49,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:49,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:49,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:49,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:49,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:49,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:49,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:49,613 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:58:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:50,197 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:58:50,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:50,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:50,198 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:58:50,198 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:58:50,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:58:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:58:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:58:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:58:50,484 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:58:50,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:50,484 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:58:50,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:58:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:50,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:50,485 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:58:50,485 INFO L423 AbstractCegarLoop]: === Iteration 267 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:50,485 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2003057218, now seen corresponding path program 251 times [2018-10-04 12:58:50,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:50,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:50,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:50,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:50,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:50,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:50,602 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:50,610 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:50,621 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:58:50,621 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:50,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:50,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:50,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:50,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:50,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:50,667 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:50,667 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:58:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:51,198 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:58:51,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:51,199 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:51,199 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:58:51,199 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:58:51,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:58:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 12:58:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:51,461 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:58:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:51,461 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:51,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:51,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:51,462 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:58:51,462 INFO L423 AbstractCegarLoop]: === Iteration 268 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:51,462 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash -229898820, now seen corresponding path program 252 times [2018-10-04 12:58:51,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:51,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:51,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:51,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:51,525 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:51,533 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:51,543 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:58:51,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:51,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:51,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:51,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:51,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:51,600 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:51,600 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:58:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:52,122 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:58:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:52,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:52,123 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:58:52,123 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:58:52,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:58:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:58:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 12:58:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:58:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:58:52,409 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:58:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:52,409 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:58:52,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:58:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:52,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:52,410 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:58:52,410 INFO L423 AbstractCegarLoop]: === Iteration 269 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:52,410 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:52,410 INFO L82 PathProgramCache]: Analyzing trace with hash -229896898, now seen corresponding path program 253 times [2018-10-04 12:58:52,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:52,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:52,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:52,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:52,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:52,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:52,491 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:52,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:52,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:52,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:52,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:52,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:52,563 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:52,563 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:58:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:53,071 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:58:53,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:53,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:53,072 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:58:53,072 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:58:53,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:58:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:58:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:53,369 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:58:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:53,369 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:53,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:53,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:53,369 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:58:53,369 INFO L423 AbstractCegarLoop]: === Iteration 270 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:53,369 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:53,370 INFO L82 PathProgramCache]: Analyzing trace with hash -228051778, now seen corresponding path program 254 times [2018-10-04 12:58:53,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:53,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:53,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:53,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:53,440 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:53,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:53,454 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:53,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:53,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:53,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:53,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:53,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:53,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:53,508 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:53,508 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:58:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:54,002 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:58:54,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:54,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:54,003 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:58:54,003 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:58:54,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:58:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:58:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:58:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:58:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:58:54,315 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:58:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:54,315 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:58:54,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:58:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:54,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:54,316 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:58:54,316 INFO L423 AbstractCegarLoop]: === Iteration 271 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:54,316 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash -228049856, now seen corresponding path program 255 times [2018-10-04 12:58:54,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:54,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:54,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:54,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:54,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:54,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:54,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 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:54,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:54,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:58:54,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:54,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:54,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:54,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:54,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:54,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:54,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:54,477 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:58:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:54,944 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:58:54,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:54,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:54,945 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:58:54,945 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:58:54,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:58:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:58:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:58:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:58:55,219 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 12:58:55,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:55,219 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:58:55,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:58:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:55,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:55,220 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:58:55,220 INFO L423 AbstractCegarLoop]: === Iteration 272 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:55,220 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:55,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1983899974, now seen corresponding path program 256 times [2018-10-04 12:58:55,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:55,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:55,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:55,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:55,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:55,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:55,312 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:55,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:55,327 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:55,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:55,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:55,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:55,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:55,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:55,375 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:55,375 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 12:58:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:56,010 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:58:56,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:56,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:56,011 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:58:56,011 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:58:56,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:58:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:58:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:58:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:58:56,305 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:58:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:56,305 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:58:56,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:58:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:56,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:56,305 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:58:56,306 INFO L423 AbstractCegarLoop]: === Iteration 273 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:56,306 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1983898052, now seen corresponding path program 257 times [2018-10-04 12:58:56,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:56,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:56,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:56,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:56,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:56,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:56,369 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:56,376 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:58:56,386 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:58:56,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:56,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:56,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:56,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:56,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:56,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:56,454 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:58:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:57,079 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:58:57,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:57,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:57,080 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:58:57,080 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:58:57,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:58:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:58:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:58:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:58:57,369 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:58:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:57,369 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:58:57,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:58:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:57,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:57,370 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:58:57,370 INFO L423 AbstractCegarLoop]: === Iteration 274 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:57,370 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:57,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1982052932, now seen corresponding path program 258 times [2018-10-04 12:58:57,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:57,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:57,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:57,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:57,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:57,450 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:57,458 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:58:57,469 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:58:57,470 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:57,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:57,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:57,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:57,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:57,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:57,532 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:57,532 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:58:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:58,133 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:58:58,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:58,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:58,134 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:58:58,134 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:58:58,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:58:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:58:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:58:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:58:58,426 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:58:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:58,426 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:58:58,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:58:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:58,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:58,427 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:58:58,427 INFO L423 AbstractCegarLoop]: === Iteration 275 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:58,427 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:58,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1982051010, now seen corresponding path program 259 times [2018-10-04 12:58:58,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:58,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:58,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:58,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:58,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:58,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:58,505 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:58,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:58,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:58,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:58,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:58,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:58,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:58,585 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:58:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:59,164 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:58:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:58:59,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:58:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:59,165 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:58:59,165 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:58:59,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:58:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:58:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 12:58:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:58:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:58:59,437 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:58:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:59,438 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:58:59,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:58:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:58:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:58:59,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:59,438 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:58:59,438 INFO L423 AbstractCegarLoop]: === Iteration 276 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:59,438 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash -208892612, now seen corresponding path program 260 times [2018-10-04 12:58:59,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:59,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:59,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:58:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:59,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:59,517 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:59,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:59,531 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:59,532 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:59,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:59,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:59,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:58:59,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:58:59,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:58:59,596 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:59,596 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:59:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:00,215 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:59:00,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:00,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:00,216 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:59:00,216 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:59:00,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:59:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:59:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:00,530 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:00,530 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:00,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:00,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:00,531 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:00,531 INFO L423 AbstractCegarLoop]: === Iteration 277 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:00,531 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:00,531 INFO L82 PathProgramCache]: Analyzing trace with hash -208890690, now seen corresponding path program 261 times [2018-10-04 12:59:00,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:00,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:00,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:00,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:00,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:00,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:00,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:00,619 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:59:00,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:00,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:00,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:00,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:00,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:00,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:00,675 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:00,675 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:01,299 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:59:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:01,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:01,300 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:59:01,300 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:59:01,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:59:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:59:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:59:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:01,589 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:01,590 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:01,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:01,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:01,590 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:01,590 INFO L423 AbstractCegarLoop]: === Iteration 278 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:01,590 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash -207045570, now seen corresponding path program 262 times [2018-10-04 12:59:01,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:01,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:01,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:01,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:01,657 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:01,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:01,672 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:01,672 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:01,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:01,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:01,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:01,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:01,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:01,737 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:01,737 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:02,337 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:59:02,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:02,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:02,338 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:59:02,338 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:59:02,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:59:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:59:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:02,650 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:02,650 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:02,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:02,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:02,651 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:02,651 INFO L423 AbstractCegarLoop]: === Iteration 279 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:02,651 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash -207043648, now seen corresponding path program 263 times [2018-10-04 12:59:02,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:02,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:02,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:02,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:02,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:02,740 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:02,776 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:59:02,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:02,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:02,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:02,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:02,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:02,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:02,847 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:02,847 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:03,419 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:59:03,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:03,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:03,420 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:59:03,420 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:59:03,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:59:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 12:59:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:59:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:59:03,680 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:59:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:03,680 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:59:03,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:59:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:03,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:03,681 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:03,681 INFO L423 AbstractCegarLoop]: === Iteration 280 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:03,681 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1303841604, now seen corresponding path program 264 times [2018-10-04 12:59:03,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:03,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:03,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:03,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:03,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:03,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:03,746 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:03,754 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:03,766 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:59:03,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:03,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:03,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:03,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:03,831 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:03,831 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:59:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:04,413 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:59:04,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:04,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:04,414 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:59:04,414 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:59:04,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:59:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:59:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:04,710 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:04,710 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:04,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:04,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:04,711 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:04,711 INFO L423 AbstractCegarLoop]: === Iteration 281 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:04,711 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1303839682, now seen corresponding path program 265 times [2018-10-04 12:59:04,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:04,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:04,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:04,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:05,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:05,013 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:05,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:05,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:05,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:05,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:05,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:05,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:05,075 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:05,075 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:05,623 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:59:05,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:05,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:05,624 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:59:05,624 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:59:05,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 9 [2018-10-04 12:59:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:59:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:59:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:05,917 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:05,918 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:05,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:05,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:05,918 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:05,918 INFO L423 AbstractCegarLoop]: === Iteration 282 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:05,918 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1301994562, now seen corresponding path program 266 times [2018-10-04 12:59:05,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:05,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:05,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:05,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:05,985 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:05,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:06,001 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:06,001 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:06,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:06,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:06,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:06,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:06,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:06,056 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:06,056 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:06,633 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:59:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:06,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:06,634 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:59:06,634 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:59:06,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:59:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:59:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:59:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:06,950 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:06,950 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:06,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:06,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:06,951 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:06,951 INFO L423 AbstractCegarLoop]: === Iteration 283 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:06,951 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:06,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1301992640, now seen corresponding path program 267 times [2018-10-04 12:59:06,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:06,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:06,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:06,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:06,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:07,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:07,013 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:07,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:07,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:59:07,032 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:07,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:07,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:07,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:07,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:07,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:07,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:07,178 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:07,747 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:59:07,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:07,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:07,748 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:59:07,748 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:59:07,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:59:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 12:59:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:59:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:59:08,035 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:59:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:08,035 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:59:08,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:08,035 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:59:08,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:08,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:08,035 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:08,036 INFO L423 AbstractCegarLoop]: === Iteration 284 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:08,036 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:08,036 INFO L82 PathProgramCache]: Analyzing trace with hash 471165758, now seen corresponding path program 268 times [2018-10-04 12:59:08,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:08,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:08,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:08,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:08,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:08,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:08,115 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:08,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:08,130 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:08,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:08,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:08,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:08,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:08,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:08,184 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:08,184 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:59:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:08,697 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:59:08,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:08,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:08,698 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:59:08,698 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:59:08,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:59:09,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 12:59:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:09,007 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:09,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:09,007 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:09,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:09,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:09,008 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:09,008 INFO L423 AbstractCegarLoop]: === Iteration 285 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:09,008 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:09,008 INFO L82 PathProgramCache]: Analyzing trace with hash 471167680, now seen corresponding path program 269 times [2018-10-04 12:59:09,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:09,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:09,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:09,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:09,084 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:09,095 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:09,106 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:59:09,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:09,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:09,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:09,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:09,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:09,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:09,159 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:09,159 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:09,688 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:59:09,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:09,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:09,689 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:59:09,689 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:59:09,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:59:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:59:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:09,978 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:09,978 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:09,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:09,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:09,978 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:09,978 INFO L423 AbstractCegarLoop]: === Iteration 286 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:09,979 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:09,979 INFO L82 PathProgramCache]: Analyzing trace with hash 473012800, now seen corresponding path program 270 times [2018-10-04 12:59:09,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:09,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:09,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:10,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:10,047 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:10,055 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:10,065 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:59:10,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:10,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:10,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:10,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:10,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:10,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:10,119 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:10,119 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:10,637 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:59:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:10,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:10,638 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:59:10,638 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:59:10,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:59:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:59:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:59:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:10,951 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:10,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:10,952 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:10,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:10,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:10,952 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:10,952 INFO L423 AbstractCegarLoop]: === Iteration 287 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:10,952 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash 473014722, now seen corresponding path program 271 times [2018-10-04 12:59:10,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:10,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:10,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:10,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:10,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:11,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:11,029 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:11,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:11,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:11,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:11,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:11,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:11,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:11,112 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:11,112 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:11,598 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:59:11,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:11,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:11,599 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:59:11,599 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:59:11,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:59:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2018-10-04 12:59:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:59:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:59:11,802 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 19 [2018-10-04 12:59:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:11,802 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:59:11,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:59:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:11,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:11,803 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:59:11,803 INFO L423 AbstractCegarLoop]: === Iteration 288 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:11,803 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:11,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1023196730, now seen corresponding path program 272 times [2018-10-04 12:59:11,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:11,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:11,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:11,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:11,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:11,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:11,869 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:11,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:11,882 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:11,882 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:11,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:11,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:11,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:11,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:11,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:11,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:11,949 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 11 states. [2018-10-04 12:59:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:12,524 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:59:12,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:12,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:12,525 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:59:12,525 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:59:12,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:59:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:59:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:12,867 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:12,867 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:12,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:12,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:12,867 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:12,867 INFO L423 AbstractCegarLoop]: === Iteration 289 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:12,867 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1023198652, now seen corresponding path program 273 times [2018-10-04 12:59:12,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:12,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:12,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:12,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:12,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:12,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:12,940 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:12,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:12,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:59:12,958 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:12,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:13,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:13,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:13,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:13,023 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:13,023 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:13,584 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:59:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:13,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:13,585 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:59:13,585 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:59:13,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:59:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:59:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:13,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:13,891 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:13,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:13,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:13,892 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:13,892 INFO L423 AbstractCegarLoop]: === Iteration 290 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:13,892 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1025043772, now seen corresponding path program 274 times [2018-10-04 12:59:13,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:13,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:13,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:13,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:13,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:13,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:13,974 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:13,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:13,986 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:13,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:13,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:14,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:14,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:14,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:14,118 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:14,118 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:14,718 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:59:14,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:14,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:14,719 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:59:14,719 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:59:14,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:59:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:59:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:15,057 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:15,057 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:15,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:15,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:15,057 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:15,057 INFO L423 AbstractCegarLoop]: === Iteration 291 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:15,057 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:15,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1025045694, now seen corresponding path program 275 times [2018-10-04 12:59:15,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:15,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:15,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:15,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:15,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:15,138 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:15,146 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:15,156 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:59:15,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:15,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:15,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:15,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:15,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:15,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:15,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:15,223 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:15,782 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:59:15,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:15,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:15,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:15,783 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:59:15,783 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:59:15,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:15,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:59:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 12:59:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:59:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:59:16,080 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:59:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:16,080 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:59:16,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:59:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:16,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:16,081 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:16,081 INFO L423 AbstractCegarLoop]: === Iteration 292 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:16,081 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1496763204, now seen corresponding path program 276 times [2018-10-04 12:59:16,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:16,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:16,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:16,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:16,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:16,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:16,160 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:16,170 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:16,180 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:59:16,180 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:16,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:16,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:16,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:16,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:16,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:16,238 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:16,238 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:59:16,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:16,793 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:59:16,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:16,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:16,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:16,794 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:59:16,794 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:59:16,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:59:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:59:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:17,127 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:17,127 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:17,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:17,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:17,128 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:17,128 INFO L423 AbstractCegarLoop]: === Iteration 293 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:17,128 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:17,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1496761282, now seen corresponding path program 277 times [2018-10-04 12:59:17,128 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:17,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:17,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:17,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:17,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:17,204 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:17,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:17,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:17,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:17,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:17,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:17,287 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:17,287 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:17,821 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:59:17,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:17,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:17,822 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:59:17,822 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:59:17,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:59:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 12:59:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:18,204 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:18,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:18,204 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:18,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:18,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:18,205 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:18,205 INFO L423 AbstractCegarLoop]: === Iteration 294 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:18,205 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1494916162, now seen corresponding path program 278 times [2018-10-04 12:59:18,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:18,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:18,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:18,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:18,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:18,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:18,284 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:18,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:18,299 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:18,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:18,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:18,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:18,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:18,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:18,352 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:18,352 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:18,854 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:59:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:18,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:18,855 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:59:18,855 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:59:18,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:59:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:59:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:19,175 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:19,176 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:19,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:19,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:19,176 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:19,176 INFO L423 AbstractCegarLoop]: === Iteration 295 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:19,176 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1494914240, now seen corresponding path program 279 times [2018-10-04 12:59:19,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:19,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:19,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:19,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:19,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:19,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:19,239 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:19,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:19,256 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:59:19,256 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:19,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:19,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:19,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:19,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:19,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:19,322 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:19,322 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:19,818 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:59:19,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:19,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:19,819 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:59:19,819 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:59:19,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:59:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:59:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:59:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:59:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:59:20,102 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:59:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:20,102 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:59:20,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:59:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:20,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:20,102 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:20,103 INFO L423 AbstractCegarLoop]: === Iteration 296 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:20,103 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1703255100, now seen corresponding path program 280 times [2018-10-04 12:59:20,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:20,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:20,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:20,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:20,179 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:20,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:20,192 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:20,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:20,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:20,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:20,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:20,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:20,256 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:20,256 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:59:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:20,859 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:59:20,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:20,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:20,860 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:59:20,860 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:59:20,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:59:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:59:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:21,191 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:21,192 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:21,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:21,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:21,192 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:21,192 INFO L423 AbstractCegarLoop]: === Iteration 297 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:21,192 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:21,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1703257022, now seen corresponding path program 281 times [2018-10-04 12:59:21,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:21,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:21,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:21,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:21,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:21,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:21,272 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:21,278 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:21,294 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:59:21,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:21,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:21,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:21,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:21,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:21,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:21,362 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:21,952 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:59:21,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:21,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:21,953 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:59:21,953 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:59:21,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:59:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:59:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:22,274 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:22,274 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:22,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:22,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:22,275 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:22,275 INFO L423 AbstractCegarLoop]: === Iteration 298 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:22,275 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1705102142, now seen corresponding path program 282 times [2018-10-04 12:59:22,275 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:22,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:22,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:22,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:22,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:22,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:22,359 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:59:22,359 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:22,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:22,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:22,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:22,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:22,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:22,604 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:22,604 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:23,614 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:59:23,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:23,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:23,615 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:59:23,615 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:59:23,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 12:59:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:59:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:59:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:23,952 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:23,953 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:23,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:23,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:23,953 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:23,953 INFO L423 AbstractCegarLoop]: === Iteration 299 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:23,953 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1705104064, now seen corresponding path program 283 times [2018-10-04 12:59:23,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:23,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:23,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:24,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:24,028 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:24,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:24,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:24,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:24,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:24,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:24,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:24,088 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:24,088 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:24,668 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:59:24,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:24,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:24,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:24,669 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:59:24,669 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:59:24,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:59:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:59:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 12:59:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:59:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:59:25,039 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:59:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:25,039 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:59:25,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:59:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:25,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:25,039 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:25,039 INFO L423 AbstractCegarLoop]: === Iteration 300 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:25,040 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:25,040 INFO L82 PathProgramCache]: Analyzing trace with hash -816704834, now seen corresponding path program 284 times [2018-10-04 12:59:25,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:25,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:25,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:25,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:25,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:25,120 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:25,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:25,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:25,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:25,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:25,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:25,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:25,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:25,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:25,191 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:25,191 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:59:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:25,751 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:59:25,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:25,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:25,752 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:59:25,752 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:59:25,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:59:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:59:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:26,093 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:26,094 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:26,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:26,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:26,094 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:26,094 INFO L423 AbstractCegarLoop]: === Iteration 301 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:26,094 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash -816702912, now seen corresponding path program 285 times [2018-10-04 12:59:26,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:26,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:26,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:26,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:26,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:26,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:26,158 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:26,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:26,178 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:59:26,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:26,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:26,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:26,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:26,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:26,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:26,243 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:26,243 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:26,780 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:59:26,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:26,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:26,781 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:59:26,781 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:59:26,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:59:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:59:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 12:59:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:27,103 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:27,103 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:27,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:27,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:27,104 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:27,104 INFO L423 AbstractCegarLoop]: === Iteration 302 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:27,104 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash -814857792, now seen corresponding path program 286 times [2018-10-04 12:59:27,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:27,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:27,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:27,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:27,187 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:27,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:27,199 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:27,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:27,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:27,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:27,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:27,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:27,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:27,263 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:27,794 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:59:27,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:27,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:27,795 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:59:27,795 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:59:27,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:59:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:59:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:28,133 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:28,133 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:28,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:28,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:28,134 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:28,134 INFO L423 AbstractCegarLoop]: === Iteration 303 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:28,134 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:28,134 INFO L82 PathProgramCache]: Analyzing trace with hash -814855870, now seen corresponding path program 287 times [2018-10-04 12:59:28,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:28,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:28,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:28,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:28,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:28,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:28,212 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:28,220 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:28,230 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:59:28,230 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:28,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:28,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:28,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:28,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:28,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:28,284 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:28,284 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:28,790 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:59:28,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:28,790 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:28,791 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:59:28,791 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:59:28,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:59:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 12:59:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:59:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:59:29,032 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 12:59:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:29,032 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:59:29,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:59:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:29,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:29,033 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:29,033 INFO L423 AbstractCegarLoop]: === Iteration 304 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:29,033 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:29,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1724261308, now seen corresponding path program 288 times [2018-10-04 12:59:29,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:29,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:29,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:29,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:29,120 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:29,128 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:29,139 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:59:29,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:29,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:29,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:29,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:29,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:29,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:29,195 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 12:59:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:29,706 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:59:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:29,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:29,707 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:59:29,707 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:59:29,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:59:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:59:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:30,046 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:30,046 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:30,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:30,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:30,047 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:30,047 INFO L423 AbstractCegarLoop]: === Iteration 305 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:30,047 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1724263230, now seen corresponding path program 289 times [2018-10-04 12:59:30,047 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:30,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:30,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:30,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:30,124 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:30,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:30,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:30,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:30,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:30,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:30,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:30,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:30,202 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:30,742 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:59:30,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:30,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:30,743 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:59:30,743 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:59:30,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:59:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:59:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:31,073 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:31,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:31,074 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:31,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:31,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:31,074 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:31,074 INFO L423 AbstractCegarLoop]: === Iteration 306 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:31,074 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:31,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1726108350, now seen corresponding path program 290 times [2018-10-04 12:59:31,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:31,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:31,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:31,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:31,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:31,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:31,152 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:31,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:31,165 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:31,165 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:31,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:31,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:31,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:31,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:31,218 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:31,218 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:31,724 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:59:31,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:31,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:31,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:31,725 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:59:31,725 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:59:31,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:59:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 12:59:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:32,076 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:32,076 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:32,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:32,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:32,077 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:32,077 INFO L423 AbstractCegarLoop]: === Iteration 307 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:32,077 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:32,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1726110272, now seen corresponding path program 291 times [2018-10-04 12:59:32,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:32,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:32,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:32,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:32,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:32,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:32,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 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:32,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:32,162 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:59:32,162 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:32,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:32,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:32,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:32,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:32,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:32,231 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:32,231 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:32,731 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:59:32,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:32,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:32,732 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:59:32,732 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:59:32,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:59:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:59:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:59:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:59:33,051 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:59:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:33,051 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:59:33,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:59:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:33,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:33,052 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:33,052 INFO L423 AbstractCegarLoop]: === Iteration 308 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:33,052 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash -795698626, now seen corresponding path program 292 times [2018-10-04 12:59:33,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:33,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:33,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:33,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:33,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:33,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:33,127 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:33,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:33,141 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:33,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:33,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:33,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:33,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:33,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:33,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:33,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:33,203 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:59:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:33,736 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:59:33,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:33,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:33,737 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:59:33,737 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:59:33,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:33,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:59:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:59:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:34,081 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:34,081 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:34,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:34,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:34,081 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:34,081 INFO L423 AbstractCegarLoop]: === Iteration 309 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:34,081 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash -795696704, now seen corresponding path program 293 times [2018-10-04 12:59:34,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:34,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:34,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:34,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:34,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:34,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:34,179 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:34,186 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:34,200 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:59:34,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:34,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:34,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:34,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:34,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:34,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:34,267 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:34,267 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:34,802 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:59:34,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:34,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:34,803 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:59:34,803 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:59:34,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:34,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:59:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:59:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:35,133 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:35,134 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:35,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:35,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:35,134 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:35,134 INFO L423 AbstractCegarLoop]: === Iteration 310 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:35,134 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash -793851584, now seen corresponding path program 294 times [2018-10-04 12:59:35,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:35,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:35,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:35,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:35,200 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:35,207 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:35,220 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:59:35,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:35,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:35,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:35,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:35,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:35,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:35,325 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:35,822 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:59:35,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:35,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:35,823 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:59:35,823 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:59:35,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:59:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 12:59:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:36,173 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:36,173 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:36,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:36,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:36,174 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:36,174 INFO L423 AbstractCegarLoop]: === Iteration 311 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:36,174 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:36,174 INFO L82 PathProgramCache]: Analyzing trace with hash -793849662, now seen corresponding path program 295 times [2018-10-04 12:59:36,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:36,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:36,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:36,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:36,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:36,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:36,253 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:36,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:36,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:36,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:36,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:36,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:36,338 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:36,338 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:36,820 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:59:36,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:36,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:36,821 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:59:36,821 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:59:36,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:59:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:59:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:59:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:59:37,116 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:59:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:37,116 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:59:37,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:59:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:37,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:37,117 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:37,117 INFO L423 AbstractCegarLoop]: === Iteration 312 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:37,117 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1890647618, now seen corresponding path program 296 times [2018-10-04 12:59:37,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:37,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:37,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:37,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:37,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:37,197 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:37,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:37,213 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:37,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:37,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:37,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:37,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:37,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:37,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:37,283 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:37,283 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:59:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:37,756 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:59:37,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:37,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:37,757 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:59:37,757 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:59:37,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:37,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:59:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-10-04 12:59:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:38,095 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:38,096 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:38,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:38,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:38,096 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:38,096 INFO L423 AbstractCegarLoop]: === Iteration 313 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:38,096 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:38,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1890645696, now seen corresponding path program 297 times [2018-10-04 12:59:38,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:38,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:38,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:38,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:38,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:38,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:38,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:38,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:38,292 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:59:38,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:38,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:38,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:38,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:38,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:38,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:38,337 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:38,338 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:38,789 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:59:38,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:38,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:38,790 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:59:38,790 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:59:38,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 9 [2018-10-04 12:59:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:59:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 12:59:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:39,127 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:39,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:39,128 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:39,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:39,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:39,128 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:39,128 INFO L423 AbstractCegarLoop]: === Iteration 314 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:39,129 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1888800576, now seen corresponding path program 298 times [2018-10-04 12:59:39,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:39,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:39,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:39,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:39,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:39,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:39,419 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:39,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:39,434 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:39,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:39,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:39,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:39,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:39,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:39,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:39,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:39,489 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:40,001 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:59:40,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:40,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:40,002 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:59:40,002 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:59:40,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 9 [2018-10-04 12:59:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:59:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-10-04 12:59:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:40,363 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:40,363 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:40,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:40,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:40,364 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:40,364 INFO L423 AbstractCegarLoop]: === Iteration 315 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:40,364 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1888798654, now seen corresponding path program 299 times [2018-10-04 12:59:40,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:40,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:40,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:40,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:40,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:40,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:40,440 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:40,448 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:40,457 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:59:40,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:40,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:40,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:40,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:40,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:40,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:40,529 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:40,529 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:40,982 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:59:40,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:40,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:40,983 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:59:40,983 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:59:40,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:59:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:59:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:59:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:59:41,305 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:59:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:41,305 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:59:41,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:59:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:41,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:41,305 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:41,305 INFO L423 AbstractCegarLoop]: === Iteration 316 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:41,306 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash -115640256, now seen corresponding path program 300 times [2018-10-04 12:59:41,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:41,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:41,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:41,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:41,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:41,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:41,375 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:41,383 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:41,393 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:59:41,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:41,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:41,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:41,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:41,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:41,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:41,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:41,467 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:59:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:41,900 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:59:41,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:41,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:41,901 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:59:41,901 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:59:41,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:59:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-10-04 12:59:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:42,251 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:42,251 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:42,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:42,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:42,252 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:42,252 INFO L423 AbstractCegarLoop]: === Iteration 317 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:42,252 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:42,252 INFO L82 PathProgramCache]: Analyzing trace with hash -115638334, now seen corresponding path program 301 times [2018-10-04 12:59:42,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:42,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:42,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:42,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:42,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:42,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:42,331 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:42,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:42,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:42,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:42,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:42,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:42,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:42,408 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:42,408 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:42,850 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:59:42,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:42,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:42,851 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:59:42,851 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:59:42,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:59:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-10-04 12:59:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:43,186 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:43,186 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:43,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:43,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:43,187 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:43,187 INFO L423 AbstractCegarLoop]: === Iteration 318 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:43,187 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:43,187 INFO L82 PathProgramCache]: Analyzing trace with hash -113793214, now seen corresponding path program 302 times [2018-10-04 12:59:43,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:43,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:43,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:43,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:43,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:43,253 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:43,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:43,268 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:43,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:43,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:43,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:43,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:43,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:43,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:43,333 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:43,333 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:43,741 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:59:43,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:43,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:43,742 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:59:43,742 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:59:43,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:59:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-10-04 12:59:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:44,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:44,125 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:44,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:44,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:44,125 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:44,126 INFO L423 AbstractCegarLoop]: === Iteration 319 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:44,126 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash -113791292, now seen corresponding path program 303 times [2018-10-04 12:59:44,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:44,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:44,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:44,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:44,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:44,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:44,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:44,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:44,295 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:59:44,295 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:44,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:44,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:44,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:44,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:44,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:44,382 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:44,382 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:44,782 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2018-10-04 12:59:44,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:44,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:44,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:44,783 INFO L225 Difference]: With dead ends: 38 [2018-10-04 12:59:44,783 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 12:59:44,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 9 [2018-10-04 12:59:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 12:59:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2018-10-04 12:59:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:59:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:59:44,999 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 19 [2018-10-04 12:59:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:44,999 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:59:44,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:59:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:44,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:44,999 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:59:45,000 INFO L423 AbstractCegarLoop]: === Iteration 320 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:45,000 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash 330139066, now seen corresponding path program 304 times [2018-10-04 12:59:45,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:45,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:45,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:45,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:45,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:45,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 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:45,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:45,113 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:45,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:45,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:45,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:45,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:45,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:45,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:45,247 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:45,247 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 11 states. [2018-10-04 12:59:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:46,029 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:59:46,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:46,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:46,030 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:59:46,030 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:59:46,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:46,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:59:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:59:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:46,418 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:46,419 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:46,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:46,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:46,419 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:46,419 INFO L423 AbstractCegarLoop]: === Iteration 321 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:46,419 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash 330140988, now seen corresponding path program 305 times [2018-10-04 12:59:46,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:46,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:46,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:46,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:46,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:46,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:46,487 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:46,496 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:46,506 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:59:46,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:46,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:46,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:46,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:46,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:46,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:46,565 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:46,565 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:47,341 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:59:47,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:47,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:47,342 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:59:47,342 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:59:47,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:59:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:59:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:59:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:47,724 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:47,725 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:47,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:47,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:47,725 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:47,725 INFO L423 AbstractCegarLoop]: === Iteration 322 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:47,725 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash 331986108, now seen corresponding path program 306 times [2018-10-04 12:59:47,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:47,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:47,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:47,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:47,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:47,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:47,801 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:47,809 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:47,821 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:59:47,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:47,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:47,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:47,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:47,889 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:47,889 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:48,636 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:59:48,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:48,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:48,637 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:59:48,637 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:59:48,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:59:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:59:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:49,020 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:49,020 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:49,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:49,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:49,020 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:49,021 INFO L423 AbstractCegarLoop]: === Iteration 323 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:49,021 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:49,021 INFO L82 PathProgramCache]: Analyzing trace with hash 331988030, now seen corresponding path program 307 times [2018-10-04 12:59:49,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:49,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:49,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:49,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:49,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:49,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:49,097 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:49,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:49,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:49,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:49,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:49,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:49,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:49,166 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:49,166 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:49,909 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:59:49,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:49,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:49,910 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:59:49,910 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:59:49,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:59:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 12:59:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:59:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:59:50,285 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:59:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:50,285 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:59:50,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:59:50,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:50,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:50,285 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:50,285 INFO L423 AbstractCegarLoop]: === Iteration 324 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:50,285 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:50,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2105146428, now seen corresponding path program 308 times [2018-10-04 12:59:50,286 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:50,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:50,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:50,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:50,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:50,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:50,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:50,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:50,373 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:50,373 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:50,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:50,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:50,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:50,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:50,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:50,429 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:50,429 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:59:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:51,222 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:59:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:51,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:51,223 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:59:51,223 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:59:51,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:59:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:59:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:51,697 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:51,697 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:51,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:51,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:51,697 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:51,697 INFO L423 AbstractCegarLoop]: === Iteration 325 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:51,698 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:51,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2105148350, now seen corresponding path program 309 times [2018-10-04 12:59:51,698 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:51,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:51,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:51,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:51,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:51,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:51,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:51,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:51,783 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:59:51,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:51,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:51,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:51,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:51,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:51,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:51,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:51,845 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:52,642 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:59:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:52,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:52,643 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:59:52,643 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:59:52,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:59:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:59:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:53,021 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:53,022 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:53,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:53,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:53,022 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:53,022 INFO L423 AbstractCegarLoop]: === Iteration 326 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:53,022 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:53,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2106993470, now seen corresponding path program 310 times [2018-10-04 12:59:53,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:53,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:53,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:53,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:53,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:53,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:53,088 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:53,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:59:53,104 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:59:53,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:53,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:53,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:53,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:53,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:53,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:53,175 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:53,175 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:53,916 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:59:53,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:53,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:53,917 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:59:53,917 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:59:53,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:59:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:59:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:59:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:54,304 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:54,304 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:54,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:54,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:54,305 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:54,305 INFO L423 AbstractCegarLoop]: === Iteration 327 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:54,305 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:54,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2106995392, now seen corresponding path program 311 times [2018-10-04 12:59:54,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:54,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:54,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:54,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:54,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:54,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:54,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:54,456 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:59:54,469 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:59:54,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:54,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:54,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:54,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:54,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:54,766 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:54,766 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:55,497 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:59:55,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:55,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:55,498 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:59:55,498 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:59:55,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 9 [2018-10-04 12:59:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:59:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 12:59:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:59:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:59:55,829 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:59:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:55,830 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:59:55,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:59:55,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:55,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:55,830 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:59:55,830 INFO L423 AbstractCegarLoop]: === Iteration 328 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:55,830 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1010197436, now seen corresponding path program 312 times [2018-10-04 12:59:55,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:55,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:55,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:55,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:55,895 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:55,902 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:59:55,912 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:59:55,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:55,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:55,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:55,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:55,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:55,975 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:55,975 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:59:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:56,683 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:59:56,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:56,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:56,683 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:59:56,684 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:59:56,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:59:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:59:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:59:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:57,076 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:57,076 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:57,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:57,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:57,076 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:57,076 INFO L423 AbstractCegarLoop]: === Iteration 329 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:57,076 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1010199358, now seen corresponding path program 313 times [2018-10-04 12:59:57,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:57,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:57,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:57,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:57,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:57,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:57,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:57,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:57,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:57,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:57,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:57,214 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:57,214 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:59:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:57,929 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:59:57,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:57,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:57,930 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:59:57,930 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:59:57,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:59:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:59:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:59:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:59:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:59:58,306 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:59:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:58,306 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:59:58,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:59:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:58,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:58,306 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:59:58,306 INFO L423 AbstractCegarLoop]: === Iteration 330 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:58,307 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1012044478, now seen corresponding path program 314 times [2018-10-04 12:59:58,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:58,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:58,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:58,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:59:58,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:58,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:58,376 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:58,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:59:58,390 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:59:58,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:58,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:58,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:58,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:58,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:58,444 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:58,444 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:59:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:59:59,171 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:59:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:59:59,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:59:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:59:59,172 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:59:59,172 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:59:59,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 12:59:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:59:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:59:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:59:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:59:59,598 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:59:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:59:59,598 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:59:59,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:59:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:59:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:59:59,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:59:59,598 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:59:59,598 INFO L423 AbstractCegarLoop]: === Iteration 331 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:59:59,599 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:59:59,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1012046400, now seen corresponding path program 315 times [2018-10-04 12:59:59,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:59:59,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:59:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:59,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:59:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:59:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:59:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:59,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:59:59,695 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:59:59,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:59:59,714 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:59:59,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:59:59,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:59:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:59:59,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:59:59,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:59:59,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:59:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:59:59,770 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:59:59,770 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:00,481 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 13:00:00,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:00,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:00,482 INFO L225 Difference]: With dead ends: 55 [2018-10-04 13:00:00,482 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 13:00:00,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 13:00:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 13:00:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 13:00:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 13:00:00,846 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 13:00:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:00,846 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 13:00:00,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 13:00:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:00,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:00,847 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:00,847 INFO L423 AbstractCegarLoop]: === Iteration 332 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:00,847 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1509762498, now seen corresponding path program 316 times [2018-10-04 13:00:00,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:00,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:00,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:00,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:00,934 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:00,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 13:00:00,948 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 13:00:00,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:00,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:01,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:01,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:01,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:01,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:01,007 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:01,007 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 13:00:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:01,677 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 13:00:01,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:01,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:01,678 INFO L225 Difference]: With dead ends: 53 [2018-10-04 13:00:01,678 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 13:00:01,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 13:00:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 13:00:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:02,073 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:02,073 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:02,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:02,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:02,073 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:02,074 INFO L423 AbstractCegarLoop]: === Iteration 333 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:02,074 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1509760576, now seen corresponding path program 317 times [2018-10-04 13:00:02,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:02,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:02,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:02,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:02,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:02,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:02,150 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:02,158 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 13:00:02,168 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 13:00:02,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:02,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:02,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:02,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:02,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:02,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:02,235 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:02,235 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:02,910 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 13:00:02,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:02,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:02,911 INFO L225 Difference]: With dead ends: 53 [2018-10-04 13:00:02,911 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 13:00:02,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 13:00:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 13:00:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:03,305 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:03,305 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:03,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:03,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:03,306 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:03,306 INFO L423 AbstractCegarLoop]: === Iteration 334 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:03,306 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1507915456, now seen corresponding path program 318 times [2018-10-04 13:00:03,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:03,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:03,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:03,368 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:03,376 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 13:00:03,384 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 13:00:03,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:03,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:03,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:03,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:03,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:03,449 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:03,449 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:04,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:04,072 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 13:00:04,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:04,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:04,073 INFO L225 Difference]: With dead ends: 51 [2018-10-04 13:00:04,073 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 13:00:04,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 13:00:04,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 13:00:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:04,455 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:04,455 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:04,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:04,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:04,456 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:04,456 INFO L423 AbstractCegarLoop]: === Iteration 335 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:04,456 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1507913534, now seen corresponding path program 319 times [2018-10-04 13:00:04,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:04,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:04,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:04,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:04,566 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:04,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:04,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:04,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:04,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:04,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:04,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:04,654 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:04,654 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:05,261 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 13:00:05,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:05,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:05,262 INFO L225 Difference]: With dead ends: 49 [2018-10-04 13:00:05,262 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 13:00:05,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 13:00:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 13:00:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 13:00:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 13:00:05,556 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 13:00:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:05,556 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 13:00:05,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 13:00:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:05,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:05,556 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 13:00:05,556 INFO L423 AbstractCegarLoop]: === Iteration 336 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:05,556 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:05,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1031203644, now seen corresponding path program 320 times [2018-10-04 13:00:05,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:05,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:05,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:05,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:05,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:05,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:05,635 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:05,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 13:00:05,657 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 13:00:05,657 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:05,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:05,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:05,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:05,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:05,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:05,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:05,706 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 13:00:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:06,533 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 13:00:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:06,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:06,534 INFO L225 Difference]: With dead ends: 61 [2018-10-04 13:00:06,534 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 13:00:06,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 13:00:06,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 13:00:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:06,944 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:06,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:06,944 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:06,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:06,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:06,944 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:06,945 INFO L423 AbstractCegarLoop]: === Iteration 337 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:06,945 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:06,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1031205566, now seen corresponding path program 321 times [2018-10-04 13:00:06,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:06,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:06,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:06,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:06,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:07,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:07,029 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:07,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 13:00:07,045 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 13:00:07,045 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:07,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:07,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:07,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:07,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:07,113 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:07,113 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:07,934 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 13:00:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:07,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:07,935 INFO L225 Difference]: With dead ends: 61 [2018-10-04 13:00:07,935 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 13:00:07,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 13:00:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 13:00:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:08,336 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:08,336 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:08,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:08,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:08,336 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:08,337 INFO L423 AbstractCegarLoop]: === Iteration 338 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:08,337 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1033050686, now seen corresponding path program 322 times [2018-10-04 13:00:08,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:08,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:08,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:08,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:08,399 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:08,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 13:00:08,413 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 13:00:08,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:08,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:08,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:08,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:08,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:08,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:08,469 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:08,469 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:09,258 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 13:00:09,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:09,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:09,259 INFO L225 Difference]: With dead ends: 59 [2018-10-04 13:00:09,259 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 13:00:09,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 13:00:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 13:00:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:09,668 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:09,668 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:09,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:09,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:09,669 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:09,669 INFO L423 AbstractCegarLoop]: === Iteration 339 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:09,669 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:09,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1033052608, now seen corresponding path program 323 times [2018-10-04 13:00:09,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:09,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:09,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:09,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:09,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:09,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:09,782 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:09,788 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 13:00:09,798 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 13:00:09,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:09,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:09,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:09,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:09,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:09,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:09,850 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:09,850 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:10,601 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 13:00:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:10,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:10,602 INFO L225 Difference]: With dead ends: 57 [2018-10-04 13:00:10,602 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 13:00:10,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 13:00:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 13:00:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 13:00:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 13:00:10,973 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 13:00:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:10,973 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 13:00:10,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 13:00:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:10,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:10,974 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:10,974 INFO L423 AbstractCegarLoop]: === Iteration 340 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:10,974 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1488756290, now seen corresponding path program 324 times [2018-10-04 13:00:10,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:10,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:10,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:10,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:10,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:11,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:11,037 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:11,045 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 13:00:11,055 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 13:00:11,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:11,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:11,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:11,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:11,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:11,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:11,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:11,117 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 13:00:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:11,934 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 13:00:11,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:11,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:11,935 INFO L225 Difference]: With dead ends: 61 [2018-10-04 13:00:11,935 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 13:00:11,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 13:00:12,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 13:00:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:12,346 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:12,346 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:12,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:12,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:12,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:12,347 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:12,347 INFO L423 AbstractCegarLoop]: === Iteration 341 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:12,347 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1488754368, now seen corresponding path program 325 times [2018-10-04 13:00:12,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:12,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:12,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:12,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:12,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:12,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:12,424 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:12,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:12,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:12,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:12,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:12,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:12,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:12,504 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:12,504 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:13,326 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 13:00:13,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:13,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:13,327 INFO L225 Difference]: With dead ends: 61 [2018-10-04 13:00:13,327 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 13:00:13,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 13:00:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 13:00:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:13,724 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:13,725 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:13,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:13,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:13,725 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:13,725 INFO L423 AbstractCegarLoop]: === Iteration 342 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:13,725 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1486909248, now seen corresponding path program 326 times [2018-10-04 13:00:13,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:13,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:13,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:13,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:13,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:13,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:13,798 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:13,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 13:00:13,812 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 13:00:13,812 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:13,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:13,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:13,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:13,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:13,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:13,880 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:13,880 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:14,654 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 13:00:14,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:14,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:14,655 INFO L225 Difference]: With dead ends: 59 [2018-10-04 13:00:14,655 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 13:00:14,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 13:00:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 13:00:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:15,062 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:15,063 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:15,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:15,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:15,063 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:15,063 INFO L423 AbstractCegarLoop]: === Iteration 343 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:15,063 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:15,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1486907326, now seen corresponding path program 327 times [2018-10-04 13:00:15,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:15,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:15,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:15,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:15,168 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:15,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 13:00:15,184 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 13:00:15,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:15,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:15,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:15,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:15,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:15,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:15,231 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:15,231 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:15,985 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 13:00:15,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:15,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:15,986 INFO L225 Difference]: With dead ends: 57 [2018-10-04 13:00:15,986 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 13:00:15,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 13:00:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 13:00:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 13:00:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 13:00:16,327 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 13:00:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:16,327 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 13:00:16,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 13:00:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:16,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:16,328 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:16,328 INFO L423 AbstractCegarLoop]: === Iteration 344 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:16,328 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:16,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1711262014, now seen corresponding path program 328 times [2018-10-04 13:00:16,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:16,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:16,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:16,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:16,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:16,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:16,636 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:16,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 13:00:16,651 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 13:00:16,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:16,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:16,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:16,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:16,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:16,696 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:16,696 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 13:00:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:17,436 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 13:00:17,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:17,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:17,437 INFO L225 Difference]: With dead ends: 57 [2018-10-04 13:00:17,437 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 13:00:17,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 9 [2018-10-04 13:00:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 13:00:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 13:00:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:17,849 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:17,849 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:17,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:17,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:17,849 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:17,850 INFO L423 AbstractCegarLoop]: === Iteration 345 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:17,850 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1711263936, now seen corresponding path program 329 times [2018-10-04 13:00:17,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:17,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:17,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:17,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:17,920 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:17,928 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 13:00:17,936 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 13:00:17,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:17,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:17,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:17,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:17,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:17,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:17,990 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:17,990 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:18,703 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 13:00:18,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:18,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:18,704 INFO L225 Difference]: With dead ends: 55 [2018-10-04 13:00:18,704 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 13:00:18,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 13:00:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 13:00:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:19,106 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:19,106 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:19,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:19,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:19,107 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:19,107 INFO L423 AbstractCegarLoop]: === Iteration 346 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:19,107 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1713109056, now seen corresponding path program 330 times [2018-10-04 13:00:19,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:19,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:19,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:19,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:19,184 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:19,193 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 13:00:19,201 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 13:00:19,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:19,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:19,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:19,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:19,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:19,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:19,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:19,269 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:20,014 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 13:00:20,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:20,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:20,015 INFO L225 Difference]: With dead ends: 57 [2018-10-04 13:00:20,015 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 13:00:20,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 13:00:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 13:00:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:20,422 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:20,422 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:20,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:20,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:20,423 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:20,423 INFO L423 AbstractCegarLoop]: === Iteration 347 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:20,423 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:20,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1713110978, now seen corresponding path program 331 times [2018-10-04 13:00:20,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:20,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:20,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:20,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:20,563 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:20,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:20,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:20,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:20,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:20,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:20,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:20,621 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:20,621 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:21,335 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 13:00:21,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:21,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:21,336 INFO L225 Difference]: With dead ends: 55 [2018-10-04 13:00:21,336 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 13:00:21,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 13:00:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 13:00:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 13:00:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 13:00:21,710 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 13:00:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:21,710 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 13:00:21,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 13:00:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:21,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:21,711 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:21,711 INFO L423 AbstractCegarLoop]: === Iteration 348 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:21,711 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:21,711 INFO L82 PathProgramCache]: Analyzing trace with hash -808697920, now seen corresponding path program 332 times [2018-10-04 13:00:21,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:21,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:21,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:21,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:21,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:21,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:21,783 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:21,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 13:00:21,795 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 13:00:21,796 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:21,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:21,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:21,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:21,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:21,865 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:21,865 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 13:00:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:22,542 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 13:00:22,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:22,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:22,543 INFO L225 Difference]: With dead ends: 53 [2018-10-04 13:00:22,543 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 13:00:22,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 13:00:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 13:00:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:22,956 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:22,956 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:22,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:22,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:22,957 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:22,957 INFO L423 AbstractCegarLoop]: === Iteration 349 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:22,957 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:22,957 INFO L82 PathProgramCache]: Analyzing trace with hash -808695998, now seen corresponding path program 333 times [2018-10-04 13:00:22,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:22,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:22,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:22,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:22,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:23,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:23,021 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:23,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 13:00:23,037 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 13:00:23,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:23,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:23,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:23,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:23,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:23,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:23,105 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:23,105 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:23,804 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 13:00:23,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:23,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:23,805 INFO L225 Difference]: With dead ends: 53 [2018-10-04 13:00:23,805 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 13:00:23,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 13:00:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 13:00:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:24,209 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:24,209 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:24,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:24,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:24,210 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:24,210 INFO L423 AbstractCegarLoop]: === Iteration 350 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:24,210 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash -806850878, now seen corresponding path program 334 times [2018-10-04 13:00:24,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:24,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:24,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:24,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:24,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:24,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:24,294 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:24,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 13:00:24,308 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 13:00:24,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:24,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:24,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:24,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:24,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:24,374 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:24,374 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:25,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:25,030 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 13:00:25,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:25,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:25,030 INFO L225 Difference]: With dead ends: 51 [2018-10-04 13:00:25,031 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 13:00:25,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 13:00:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 13:00:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:25,442 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:25,442 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:25,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:25,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:25,443 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 13:00:25,443 INFO L423 AbstractCegarLoop]: === Iteration 351 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:25,443 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash -806848956, now seen corresponding path program 335 times [2018-10-04 13:00:25,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:25,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:25,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:25,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:25,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 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:25,641 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 13:00:25,650 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 13:00:25,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:25,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:25,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:25,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:25,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:25,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:25,707 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:25,707 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:26,336 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 13:00:26,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:26,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:26,337 INFO L225 Difference]: With dead ends: 49 [2018-10-04 13:00:26,337 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 13:00:26,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 13:00:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 13:00:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2018-10-04 13:00:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 13:00:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 13:00:26,613 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 19 [2018-10-04 13:00:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:26,613 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 13:00:26,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 13:00:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:26,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:26,614 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 13:00:26,614 INFO L423 AbstractCegarLoop]: === Iteration 352 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:26,614 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:26,614 INFO L82 PathProgramCache]: Analyzing trace with hash -256666948, now seen corresponding path program 336 times [2018-10-04 13:00:26,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:26,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:26,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:26,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:26,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:26,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:26,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 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:26,696 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 13:00:26,704 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 13:00:26,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:26,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:26,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:26,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:26,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:26,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:26,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:26,774 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 11 states. [2018-10-04 13:00:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:27,523 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 13:00:27,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:27,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:27,524 INFO L225 Difference]: With dead ends: 55 [2018-10-04 13:00:27,524 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 13:00:27,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 13:00:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 13:00:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:27,954 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:27,954 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:27,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:27,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:27,954 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:27,955 INFO L423 AbstractCegarLoop]: === Iteration 353 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:27,955 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:27,955 INFO L82 PathProgramCache]: Analyzing trace with hash -256665026, now seen corresponding path program 337 times [2018-10-04 13:00:27,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:27,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:27,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:27,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:27,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:28,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:28,032 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:28,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:28,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:28,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:28,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:28,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:28,113 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:28,113 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:28,832 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 13:00:28,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:28,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:28,833 INFO L225 Difference]: With dead ends: 53 [2018-10-04 13:00:28,833 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 13:00:28,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 13:00:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 13:00:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:29,253 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:29,254 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:29,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:29,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:29,254 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:29,254 INFO L423 AbstractCegarLoop]: === Iteration 354 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:29,254 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash -254819906, now seen corresponding path program 338 times [2018-10-04 13:00:29,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:29,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:29,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:29,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:29,315 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:29,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 13:00:29,328 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 13:00:29,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:29,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:29,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:29,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:29,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:29,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:29,386 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:29,386 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:30,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:30,134 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 13:00:30,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:30,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:30,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:30,135 INFO L225 Difference]: With dead ends: 55 [2018-10-04 13:00:30,135 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 13:00:30,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 13:00:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 13:00:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:30,561 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:30,561 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:30,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:30,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:30,561 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:30,561 INFO L423 AbstractCegarLoop]: === Iteration 355 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:30,561 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash -254817984, now seen corresponding path program 339 times [2018-10-04 13:00:30,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:30,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:30,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:30,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:30,633 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:30,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 13:00:30,648 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 13:00:30,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:30,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:30,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:30,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:30,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:30,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:30,700 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:30,700 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:31,412 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 13:00:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:31,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:31,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:31,413 INFO L225 Difference]: With dead ends: 53 [2018-10-04 13:00:31,413 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 13:00:31,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 13:00:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 13:00:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 13:00:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 13:00:31,812 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 13:00:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:31,812 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 13:00:31,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 13:00:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:31,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:31,813 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:31,813 INFO L423 AbstractCegarLoop]: === Iteration 356 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:31,813 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:31,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1518340414, now seen corresponding path program 340 times [2018-10-04 13:00:31,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:31,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:31,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:31,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:31,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:31,891 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 13:00:31,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:31,936 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 13:00:31,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:31,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:32,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:32,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:32,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:32,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:32,018 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:32,018 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 13:00:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:32,681 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 13:00:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:32,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:32,682 INFO L225 Difference]: With dead ends: 51 [2018-10-04 13:00:32,682 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 13:00:32,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 13:00:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 13:00:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:33,116 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:33,116 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:33,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:33,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:33,117 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:33,117 INFO L423 AbstractCegarLoop]: === Iteration 357 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:33,117 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:33,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1518342336, now seen corresponding path program 341 times [2018-10-04 13:00:33,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:33,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:33,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:33,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:33,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:33,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:33,190 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:33,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 13:00:33,206 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 13:00:33,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:33,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:33,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:33,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:33,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:33,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:33,276 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:33,276 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:33,961 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 13:00:33,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:33,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:33,962 INFO L225 Difference]: With dead ends: 51 [2018-10-04 13:00:33,962 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 13:00:33,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 13:00:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 13:00:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:34,384 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:34,384 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:34,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:34,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:34,384 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:34,384 INFO L423 AbstractCegarLoop]: === Iteration 358 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:34,384 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:34,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1520187456, now seen corresponding path program 342 times [2018-10-04 13:00:34,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:34,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:34,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:34,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:34,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:34,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:34,466 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:34,473 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 13:00:34,482 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 13:00:34,482 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:34,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:34,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:34,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:34,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:34,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:34,533 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:34,533 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:35,183 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 13:00:35,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:35,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:35,184 INFO L225 Difference]: With dead ends: 49 [2018-10-04 13:00:35,184 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 13:00:35,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 13:00:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 13:00:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:35,625 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:35,625 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:35,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:35,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:35,625 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:35,626 INFO L423 AbstractCegarLoop]: === Iteration 359 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:35,626 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1520189378, now seen corresponding path program 343 times [2018-10-04 13:00:35,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:35,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:35,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:35,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:35,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:35,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:35,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:35,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:35,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:35,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:35,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:35,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:35,773 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:36,395 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 13:00:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:36,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:36,396 INFO L225 Difference]: With dead ends: 47 [2018-10-04 13:00:36,396 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 13:00:36,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 13:00:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 13:00:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 13:00:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 13:00:36,762 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 13:00:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:36,763 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 13:00:36,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 13:00:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:36,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:36,763 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:36,763 INFO L423 AbstractCegarLoop]: === Iteration 360 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:36,763 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash 423391422, now seen corresponding path program 344 times [2018-10-04 13:00:36,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:36,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:36,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:36,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:36,826 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:36,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 13:00:36,839 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 13:00:36,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:36,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:36,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:36,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:36,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:36,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:36,897 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:36,897 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 13:00:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:37,643 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 13:00:37,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:37,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:37,644 INFO L225 Difference]: With dead ends: 55 [2018-10-04 13:00:37,644 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 13:00:37,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 13:00:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 13:00:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:38,091 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:38,092 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:38,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:38,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:38,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:38,092 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:38,092 INFO L423 AbstractCegarLoop]: === Iteration 361 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:38,092 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:38,092 INFO L82 PathProgramCache]: Analyzing trace with hash 423393344, now seen corresponding path program 345 times [2018-10-04 13:00:38,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:38,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:38,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:38,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:38,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:38,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:38,154 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:38,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 13:00:38,172 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 13:00:38,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:38,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:38,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:38,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:38,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:38,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:38,265 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:38,265 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:38,992 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 13:00:38,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:38,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:38,993 INFO L225 Difference]: With dead ends: 53 [2018-10-04 13:00:38,993 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 13:00:38,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 13:00:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 13:00:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:39,418 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:39,418 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:39,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:39,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:39,418 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:39,418 INFO L423 AbstractCegarLoop]: === Iteration 362 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:39,419 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:39,419 INFO L82 PathProgramCache]: Analyzing trace with hash 425238464, now seen corresponding path program 346 times [2018-10-04 13:00:39,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:39,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:39,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:39,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:39,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:39,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:39,477 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:39,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 13:00:39,496 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 13:00:39,497 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:39,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:39,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:39,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:39,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:39,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:39,616 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:39,616 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:40,350 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 13:00:40,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:40,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:40,351 INFO L225 Difference]: With dead ends: 55 [2018-10-04 13:00:40,351 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 13:00:40,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 13:00:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 13:00:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:40,788 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:40,788 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:40,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:40,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:40,789 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:40,789 INFO L423 AbstractCegarLoop]: === Iteration 363 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:40,789 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash 425240386, now seen corresponding path program 347 times [2018-10-04 13:00:40,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:40,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:40,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:40,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:40,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:40,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:40,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 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:40,873 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 13:00:40,884 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 13:00:40,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:40,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:40,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:40,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:40,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:40,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:40,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:40,949 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:41,662 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 13:00:41,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:41,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:41,663 INFO L225 Difference]: With dead ends: 53 [2018-10-04 13:00:41,663 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 13:00:41,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 13:00:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 13:00:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 13:00:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 13:00:42,062 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 13:00:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:42,063 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 13:00:42,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 13:00:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:42,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:42,063 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:42,063 INFO L423 AbstractCegarLoop]: === Iteration 364 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:42,063 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2096568512, now seen corresponding path program 348 times [2018-10-04 13:00:42,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:42,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:42,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:42,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:42,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:42,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:42,121 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:42,128 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 13:00:42,138 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 13:00:42,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:42,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:42,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:42,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:42,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:42,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:42,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:42,204 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 13:00:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:42,886 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 13:00:42,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:42,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:42,887 INFO L225 Difference]: With dead ends: 51 [2018-10-04 13:00:42,887 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 13:00:42,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 13:00:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 13:00:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:43,324 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:43,324 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:43,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:43,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:43,324 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:43,325 INFO L423 AbstractCegarLoop]: === Iteration 365 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:43,325 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:43,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2096566590, now seen corresponding path program 349 times [2018-10-04 13:00:43,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:43,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:43,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:43,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:43,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:43,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:43,384 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:43,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:43,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:43,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:43,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:43,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:43,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:43,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:43,452 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:44,132 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 13:00:44,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:44,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:44,133 INFO L225 Difference]: With dead ends: 51 [2018-10-04 13:00:44,133 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 13:00:44,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 13:00:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 13:00:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:44,559 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:44,559 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:44,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:44,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:44,559 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:44,560 INFO L423 AbstractCegarLoop]: === Iteration 366 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:44,560 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:44,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2094721470, now seen corresponding path program 350 times [2018-10-04 13:00:44,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:44,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:44,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:44,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:44,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:44,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:44,613 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:44,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 13:00:44,626 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 13:00:44,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:44,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:44,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:44,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:44,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:44,684 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:44,685 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:45,343 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 13:00:45,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:45,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:45,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:45,344 INFO L225 Difference]: With dead ends: 49 [2018-10-04 13:00:45,344 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 13:00:45,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 13:00:45,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 13:00:45,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:45,788 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:45,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:45,788 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:45,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:45,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:45,789 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 13:00:45,789 INFO L423 AbstractCegarLoop]: === Iteration 367 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:45,789 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2094719548, now seen corresponding path program 351 times [2018-10-04 13:00:45,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:45,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:45,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:45,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:45,877 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:45,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 13:00:45,893 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 13:00:45,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:45,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:45,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:45,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:45,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:45,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:45,938 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:45,938 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:46,567 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 13:00:46,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:46,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:46,568 INFO L225 Difference]: With dead ends: 47 [2018-10-04 13:00:46,568 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 13:00:46,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 13:00:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 13:00:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 13:00:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 13:00:46,901 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 13:00:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:46,901 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 13:00:46,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 13:00:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:46,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:46,901 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:46,901 INFO L423 AbstractCegarLoop]: === Iteration 368 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:46,901 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:46,902 INFO L82 PathProgramCache]: Analyzing trace with hash 444397630, now seen corresponding path program 352 times [2018-10-04 13:00:46,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:46,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:46,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:46,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:46,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:46,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:46,965 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:46,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 13:00:46,979 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 13:00:46,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:46,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:47,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:47,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:47,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:47,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:47,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:47,042 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 13:00:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:47,700 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 13:00:47,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:47,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:47,700 INFO L225 Difference]: With dead ends: 49 [2018-10-04 13:00:47,701 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 13:00:47,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 13:00:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 13:00:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:48,148 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:48,148 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:48,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:48,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:48,149 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:48,149 INFO L423 AbstractCegarLoop]: === Iteration 369 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:48,149 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:48,149 INFO L82 PathProgramCache]: Analyzing trace with hash 444399552, now seen corresponding path program 353 times [2018-10-04 13:00:48,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:48,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:48,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:48,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:48,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:48,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:48,212 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:48,220 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 13:00:48,228 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 13:00:48,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:48,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:48,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:48,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:48,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:48,303 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:48,303 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:48,949 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 13:00:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:48,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:48,950 INFO L225 Difference]: With dead ends: 49 [2018-10-04 13:00:48,950 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 13:00:48,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 13:00:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 13:00:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:49,387 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:49,387 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:49,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:49,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:49,387 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:49,387 INFO L423 AbstractCegarLoop]: === Iteration 370 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:49,387 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:49,388 INFO L82 PathProgramCache]: Analyzing trace with hash 446244672, now seen corresponding path program 354 times [2018-10-04 13:00:49,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:49,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:49,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:49,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:49,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:49,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:49,451 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:49,458 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 13:00:49,468 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 13:00:49,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:49,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:49,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:49,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:49,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:49,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:49,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:49,523 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:50,134 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 13:00:50,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:50,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:50,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:50,135 INFO L225 Difference]: With dead ends: 47 [2018-10-04 13:00:50,135 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 13:00:50,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 13:00:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 13:00:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:50,614 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:50,614 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:50,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:50,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:50,614 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:50,614 INFO L423 AbstractCegarLoop]: === Iteration 371 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:50,614 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash 446246594, now seen corresponding path program 355 times [2018-10-04 13:00:50,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:50,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:50,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:50,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:50,707 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:50,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:50,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:50,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:50,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:50,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:50,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:50,770 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:50,770 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:51,363 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 13:00:51,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:51,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:51,364 INFO L225 Difference]: With dead ends: 45 [2018-10-04 13:00:51,364 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 13:00:51,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 13:00:51,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 13:00:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 13:00:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 13:00:51,796 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 13:00:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:51,796 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 13:00:51,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 13:00:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:51,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:51,797 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 13:00:51,797 INFO L423 AbstractCegarLoop]: === Iteration 372 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:51,797 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:51,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2075562304, now seen corresponding path program 356 times [2018-10-04 13:00:51,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:51,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:51,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:51,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 13:00:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:51,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:51,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:51,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 13:00:51,876 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 13:00:51,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:51,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:51,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:51,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:51,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:51,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:51,944 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:51,944 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 13:00:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:52,596 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 13:00:52,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:52,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:52,597 INFO L225 Difference]: With dead ends: 49 [2018-10-04 13:00:52,597 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 13:00:52,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 13:00:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 13:00:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 13:00:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:53,056 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:53,056 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:53,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:53,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:53,056 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:53,056 INFO L423 AbstractCegarLoop]: === Iteration 373 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:53,056 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:53,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2075560382, now seen corresponding path program 357 times [2018-10-04 13:00:53,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:53,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:53,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:53,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:53,122 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:53,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 13:00:53,142 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 13:00:53,143 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:53,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:53,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:53,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:53,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:53,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:53,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:53,189 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 13:00:53,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:53,840 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 13:00:53,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:53,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:53,841 INFO L225 Difference]: With dead ends: 49 [2018-10-04 13:00:53,841 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 13:00:53,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 13:00:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 13:00:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 13:00:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 13:00:54,278 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 13:00:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:54,278 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 13:00:54,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 13:00:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:54,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:54,278 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 13:00:54,278 INFO L423 AbstractCegarLoop]: === Iteration 374 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:54,278 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2073715262, now seen corresponding path program 358 times [2018-10-04 13:00:54,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:54,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:54,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:54,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:54,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 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:54,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 13:00:54,349 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 13:00:54,349 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:54,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:54,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:54,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:54,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:54,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:54,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:54,417 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 13:00:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 13:00:55,056 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 13:00:55,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 13:00:55,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 13:00:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 13:00:55,057 INFO L225 Difference]: With dead ends: 47 [2018-10-04 13:00:55,057 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 13:00:55,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 13:00:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 13:00:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 13:00:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 13:00:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 13:00:55,503 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 13:00:55,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 13:00:55,503 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 13:00:55,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 13:00:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 13:00:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:00:55,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 13:00:55,504 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 13:00:55,504 INFO L423 AbstractCegarLoop]: === Iteration 375 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 13:00:55,504 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:00:55,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2073713340, now seen corresponding path program 359 times [2018-10-04 13:00:55,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 13:00:55,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 13:00:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:55,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 13:00:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 13:00:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:00:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:55,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 13:00:55,559 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 13:00:55,566 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 13:00:55,576 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 13:00:55,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 13:00:55,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 13:00:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:00:55,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 13:00:55,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 13:00:55,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 13:00:55,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 13:00:55,637 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 13:00:55,637 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. Received shutdown request... [2018-10-04 13:00:56,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 13:00:56,006 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 13:00:56,011 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 13:00:56,011 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 01:00:56 BoogieIcfgContainer [2018-10-04 13:00:56,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 13:00:56,012 INFO L168 Benchmark]: Toolchain (without parser) took 261379.86 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -441.5 MB). Free memory was 1.5 GB in the beginning and 956.3 MB in the end (delta: 510.9 MB). Peak memory consumption was 69.5 MB. Max. memory is 7.1 GB. [2018-10-04 13:00:56,014 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 13:00:56,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 13:00:56,015 INFO L168 Benchmark]: Boogie Preprocessor took 23.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 13:00:56,015 INFO L168 Benchmark]: RCFGBuilder took 308.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 13:00:56,015 INFO L168 Benchmark]: TraceAbstraction took 260997.97 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -441.5 MB). Free memory was 1.4 GB in the beginning and 956.3 MB in the end (delta: 489.8 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2018-10-04 13:00:56,017 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.93 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.62 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 308.60 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 260997.97 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -441.5 MB). Free memory was 1.4 GB in the beginning and 956.3 MB in the end (delta: 489.8 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (34states) and FLOYD_HOARE automaton (currently 9 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 260.9s OverallTime, 375 OverallIterations, 8 TraceHistogramMax, 126.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1500 SDtfs, 2871 SDslu, 5058 SDs, 0 SdLazy, 8607 SolverSat, 4916 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8992 GetRequests, 6119 SyntacticMatches, 0 SemanticMatches, 2873 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=256, 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: 66.1s AutomataMinimizationTime, 374 MinimizatonAttempts, 5590 StatesRemovedByMinimization, 374 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 51.2s InterpolantComputationTime, 12239 NumberOfCodeBlocks, 12239 NumberOfCodeBlocksAsserted, 2119 NumberOfCheckSat, 11490 ConstructedInterpolants, 0 QuantifiedInterpolants, 523560 SizeOfPredicates, 374 NumberOfNonLiveVariables, 15856 ConjunctsInSsa, 3246 ConjunctsInUnsatCore, 749 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34804 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/Luxembourg-sophisticated.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_13-00-56-025.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_13-00-56-025.csv Completed graceful shutdown