java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:06:21,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:06:21,419 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:06:21,433 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:06:21,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:06:21,434 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:06:21,436 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:06:21,438 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:06:21,440 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:06:21,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:06:21,447 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:06:21,447 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:06:21,450 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:06:21,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:06:21,453 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:06:21,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:06:21,458 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:06:21,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:06:21,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:06:21,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:06:21,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:06:21,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:06:21,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:06:21,477 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:06:21,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:06:21,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:06:21,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:06:21,483 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:06:21,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:06:21,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:06:21,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:06:21,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:06:21,488 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:06:21,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:06:21,490 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:06:21,491 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:06:21,491 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 23:06:21,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:06:21,519 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:06:21,520 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:06:21,520 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:06:21,521 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:06:21,521 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:06:21,521 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:06:21,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:06:21,522 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:06:21,522 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:06:21,522 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:06:21,522 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:06:21,522 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:06:21,523 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:06:21,523 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:06:21,523 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:06:21,523 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:06:21,523 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:06:21,525 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:06:21,525 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:06:21,525 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:06:21,525 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:06:21,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:06:21,526 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:06:21,526 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:06:21,526 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:06:21,526 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:06:21,526 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:06:21,526 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:06:21,527 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:06:21,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:06:21,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:06:21,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:06:21,616 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:06:21,616 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:06:21,617 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-09-30 23:06:21,618 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-09-30 23:06:21,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:06:21,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:06:21,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:06:21,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:06:21,707 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:06:21,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/1) ... [2018-09-30 23:06:21,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/1) ... [2018-09-30 23:06:21,749 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 23:06:21,750 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 23:06:21,750 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 23:06:21,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:06:21,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:06:21,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:06:21,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:06:21,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/1) ... [2018-09-30 23:06:21,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/1) ... [2018-09-30 23:06:21,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/1) ... [2018-09-30 23:06:21,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/1) ... [2018-09-30 23:06:21,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/1) ... [2018-09-30 23:06:21,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/1) ... [2018-09-30 23:06:21,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/1) ... [2018-09-30 23:06:21,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:06:21,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:06:21,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:06:21,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:06:21,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:06:21,882 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 23:06:21,883 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 23:06:21,883 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 23:06:22,701 INFO L345 CfgBuilder]: Using library mode [2018-09-30 23:06:22,702 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:06:22 BoogieIcfgContainer [2018-09-30 23:06:22,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:06:22,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:06:22,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:06:22,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:06:22,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:21" (1/2) ... [2018-09-30 23:06:22,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e97fcf2 and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:06:22, skipping insertion in model container [2018-09-30 23:06:22,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:06:22" (2/2) ... [2018-09-30 23:06:22,710 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-09-30 23:06:22,719 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:06:22,731 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-30 23:06:22,787 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:06:22,788 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:06:22,788 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:06:22,788 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:06:22,788 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:06:22,788 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:06:22,789 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:06:22,789 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:06:22,790 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:06:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-30 23:06:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 23:06:22,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:22,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:22,827 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:22,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:22,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-30 23:06:22,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:22,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:22,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:22,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:23,134 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:23,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:06:23,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 23:06:23,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 23:06:23,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 23:06:23,159 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-30 23:06:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:25,234 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-30 23:06:25,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 23:06:25,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 23:06:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:25,255 INFO L225 Difference]: With dead ends: 163 [2018-09-30 23:06:25,255 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 23:06:25,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 23:06:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-30 23:06:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 23:06:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-30 23:06:25,327 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-30 23:06:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:25,328 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-30 23:06:25,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 23:06:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-30 23:06:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 23:06:25,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:25,330 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:25,331 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:25,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:25,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-30 23:06:25,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:25,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:25,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:25,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:25,439 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:25,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:06:25,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 23:06:25,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 23:06:25,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 23:06:25,442 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-30 23:06:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:26,301 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-30 23:06:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 23:06:26,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 23:06:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:26,305 INFO L225 Difference]: With dead ends: 188 [2018-09-30 23:06:26,306 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 23:06:26,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 23:06:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-30 23:06:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-30 23:06:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-30 23:06:26,351 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-30 23:06:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:26,352 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-30 23:06:26,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 23:06:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-30 23:06:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:06:26,355 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:26,355 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:26,356 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:26,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-30 23:06:26,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:26,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:26,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:26,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:26,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:26,461 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:26,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:06:26,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:06:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:06:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:06:26,463 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-30 23:06:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:27,861 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-09-30 23:06:27,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:06:27,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 23:06:27,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:27,865 INFO L225 Difference]: With dead ends: 283 [2018-09-30 23:06:27,866 INFO L226 Difference]: Without dead ends: 278 [2018-09-30 23:06:27,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:06:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-30 23:06:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-09-30 23:06:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-30 23:06:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-09-30 23:06:27,899 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-09-30 23:06:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:27,899 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-09-30 23:06:27,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:06:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-09-30 23:06:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:06:27,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:27,901 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:27,902 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:27,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:27,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-30 23:06:27,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:27,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:27,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:27,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:28,099 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:28,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:06:28,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:06:28,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:06:28,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:06:28,101 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-09-30 23:06:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:30,021 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-09-30 23:06:30,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:06:30,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 23:06:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:30,030 INFO L225 Difference]: With dead ends: 387 [2018-09-30 23:06:30,030 INFO L226 Difference]: Without dead ends: 375 [2018-09-30 23:06:30,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:06:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-30 23:06:30,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-09-30 23:06:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 23:06:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-30 23:06:30,076 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-30 23:06:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:30,077 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-30 23:06:30,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:06:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-30 23:06:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:30,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:30,079 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:30,080 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:30,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-30 23:06:30,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:30,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:30,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:30,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:30,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:30,189 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:30,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:30,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:30,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:30,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:30,190 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-09-30 23:06:31,516 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 23:06:34,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:34,262 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-09-30 23:06:34,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:06:34,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:34,269 INFO L225 Difference]: With dead ends: 725 [2018-09-30 23:06:34,269 INFO L226 Difference]: Without dead ends: 717 [2018-09-30 23:06:34,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:06:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-09-30 23:06:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-09-30 23:06:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 23:06:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-09-30 23:06:34,337 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-09-30 23:06:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:34,337 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-09-30 23:06:34,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-09-30 23:06:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:34,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:34,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:34,340 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:34,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-30 23:06:34,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:34,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:34,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:34,512 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:34,512 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:34,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:34,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:34,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:34,516 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-09-30 23:06:37,021 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-30 23:06:37,961 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-30 23:06:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:40,287 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-09-30 23:06:40,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 23:06:40,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:40,295 INFO L225 Difference]: With dead ends: 1008 [2018-09-30 23:06:40,295 INFO L226 Difference]: Without dead ends: 1000 [2018-09-30 23:06:40,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-30 23:06:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-09-30 23:06:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-09-30 23:06:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-30 23:06:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-09-30 23:06:40,375 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-09-30 23:06:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:40,376 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-09-30 23:06:40,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-09-30 23:06:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:40,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:40,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:40,378 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:40,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-30 23:06:40,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:40,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:40,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:40,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:40,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:40,549 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:40,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:40,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:40,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:40,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:40,550 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-09-30 23:06:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:43,233 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-09-30 23:06:43,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 23:06:43,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:43,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:43,241 INFO L225 Difference]: With dead ends: 924 [2018-09-30 23:06:43,241 INFO L226 Difference]: Without dead ends: 916 [2018-09-30 23:06:43,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:06:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-09-30 23:06:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-09-30 23:06:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-30 23:06:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-09-30 23:06:43,319 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-09-30 23:06:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:43,319 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-09-30 23:06:43,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-09-30 23:06:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:43,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:43,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:43,321 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:43,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:43,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-30 23:06:43,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:43,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:43,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:43,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:43,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:43,410 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:43,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:43,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:43,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:43,411 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-09-30 23:06:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:45,356 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-09-30 23:06:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:06:45,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:45,363 INFO L225 Difference]: With dead ends: 791 [2018-09-30 23:06:45,363 INFO L226 Difference]: Without dead ends: 783 [2018-09-30 23:06:45,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:06:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-30 23:06:45,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-09-30 23:06:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-09-30 23:06:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-09-30 23:06:45,459 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-09-30 23:06:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:45,460 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-09-30 23:06:45,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-09-30 23:06:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:45,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:45,461 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:45,462 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:45,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-09-30 23:06:45,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:45,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:45,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:45,545 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:45,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:45,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:45,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:45,547 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-09-30 23:06:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:47,795 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-09-30 23:06:47,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 23:06:47,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:47,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:47,802 INFO L225 Difference]: With dead ends: 1040 [2018-09-30 23:06:47,802 INFO L226 Difference]: Without dead ends: 1032 [2018-09-30 23:06:47,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 23:06:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-09-30 23:06:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-09-30 23:06:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-30 23:06:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-09-30 23:06:47,944 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-09-30 23:06:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:47,945 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-09-30 23:06:47,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-09-30 23:06:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:47,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:47,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:47,947 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:47,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:47,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-09-30 23:06:47,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:47,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:47,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:47,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:48,113 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:48,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:48,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:48,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:48,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:48,114 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-09-30 23:06:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:50,902 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-09-30 23:06:50,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 23:06:50,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:50,910 INFO L225 Difference]: With dead ends: 1166 [2018-09-30 23:06:50,910 INFO L226 Difference]: Without dead ends: 1158 [2018-09-30 23:06:50,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 23:06:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-09-30 23:06:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-09-30 23:06:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-30 23:06:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-09-30 23:06:51,094 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-09-30 23:06:51,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:51,095 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-09-30 23:06:51,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-09-30 23:06:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:51,096 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:51,096 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:51,096 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:51,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-09-30 23:06:51,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:51,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:51,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:51,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:51,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:51,433 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:51,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:51,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:51,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:51,434 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-09-30 23:06:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:54,154 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-09-30 23:06:54,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 23:06:54,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:54,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:54,161 INFO L225 Difference]: With dead ends: 1127 [2018-09-30 23:06:54,162 INFO L226 Difference]: Without dead ends: 1119 [2018-09-30 23:06:54,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 23:06:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-30 23:06:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-09-30 23:06:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-30 23:06:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-09-30 23:06:54,315 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-09-30 23:06:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:54,315 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-09-30 23:06:54,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-09-30 23:06:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:54,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:54,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:54,317 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:54,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:54,317 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-09-30 23:06:54,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:54,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:54,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:54,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:54,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:54,460 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:54,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:54,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:54,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:54,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:54,461 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-09-30 23:06:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:56,867 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-09-30 23:06:56,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 23:06:56,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:56,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:56,873 INFO L225 Difference]: With dead ends: 975 [2018-09-30 23:06:56,874 INFO L226 Difference]: Without dead ends: 967 [2018-09-30 23:06:56,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 23:06:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-09-30 23:06:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-09-30 23:06:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-30 23:06:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-09-30 23:06:57,042 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-09-30 23:06:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:57,044 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-09-30 23:06:57,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-09-30 23:06:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:06:57,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:57,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:57,045 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:57,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-09-30 23:06:57,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:57,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:57,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:57,130 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:57,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:06:57,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:57,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:57,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:57,131 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-09-30 23:06:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:59,839 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-09-30 23:06:59,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 23:06:59,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:06:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:59,844 INFO L225 Difference]: With dead ends: 1011 [2018-09-30 23:06:59,844 INFO L226 Difference]: Without dead ends: 1003 [2018-09-30 23:06:59,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 23:06:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-09-30 23:07:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-09-30 23:07:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-30 23:07:00,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-09-30 23:07:00,064 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-09-30 23:07:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:00,065 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-09-30 23:07:00,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:07:00,065 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-09-30 23:07:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:00,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:00,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:00,066 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:00,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:00,066 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-09-30 23:07:00,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:00,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:00,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:00,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:00,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:00,147 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:00,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:00,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:07:00,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:07:00,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:07:00,148 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-09-30 23:07:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:02,234 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-09-30 23:07:02,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:07:02,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 23:07:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:02,239 INFO L225 Difference]: With dead ends: 859 [2018-09-30 23:07:02,239 INFO L226 Difference]: Without dead ends: 851 [2018-09-30 23:07:02,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:07:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-09-30 23:07:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-09-30 23:07:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-30 23:07:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-30 23:07:02,436 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-30 23:07:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:02,436 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-30 23:07:02,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:07:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-30 23:07:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:02,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:02,437 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:02,437 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:02,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:02,438 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-30 23:07:02,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:02,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:02,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:02,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:02,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:02,562 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:02,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:02,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:02,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:02,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:02,563 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-30 23:07:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:04,995 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-09-30 23:07:04,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:07:04,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:07:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:04,999 INFO L225 Difference]: With dead ends: 962 [2018-09-30 23:07:04,999 INFO L226 Difference]: Without dead ends: 954 [2018-09-30 23:07:05,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:07:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-30 23:07:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-09-30 23:07:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-30 23:07:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-09-30 23:07:05,288 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-09-30 23:07:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:05,288 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-09-30 23:07:05,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-09-30 23:07:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:05,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:05,289 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:05,289 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:05,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:05,290 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-09-30 23:07:05,290 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:05,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:05,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:05,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:05,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:05,377 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:05,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:05,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:05,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:05,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:05,378 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-09-30 23:07:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:07,990 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-09-30 23:07:07,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 23:07:07,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:07:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:07,997 INFO L225 Difference]: With dead ends: 1064 [2018-09-30 23:07:07,997 INFO L226 Difference]: Without dead ends: 1056 [2018-09-30 23:07:07,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-30 23:07:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-09-30 23:07:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-09-30 23:07:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-09-30 23:07:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-09-30 23:07:08,326 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-09-30 23:07:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:08,326 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-09-30 23:07:08,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-09-30 23:07:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:08,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:08,327 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:08,328 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:08,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-30 23:07:08,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:08,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:08,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:08,411 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:08,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:08,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:08,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:08,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:08,412 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-09-30 23:07:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:11,742 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-09-30 23:07:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 23:07:11,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:07:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:11,747 INFO L225 Difference]: With dead ends: 1241 [2018-09-30 23:07:11,747 INFO L226 Difference]: Without dead ends: 1233 [2018-09-30 23:07:11,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 23:07:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-09-30 23:07:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-09-30 23:07:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 23:07:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-09-30 23:07:12,114 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-09-30 23:07:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:12,115 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-09-30 23:07:12,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-09-30 23:07:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:12,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:12,116 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:12,117 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:12,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:12,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-09-30 23:07:12,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:12,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:12,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:12,199 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:12,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:12,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:12,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:12,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:12,200 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-09-30 23:07:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:14,670 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-09-30 23:07:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:07:14,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:07:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:14,676 INFO L225 Difference]: With dead ends: 1139 [2018-09-30 23:07:14,676 INFO L226 Difference]: Without dead ends: 1131 [2018-09-30 23:07:14,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:07:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-30 23:07:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-09-30 23:07:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-09-30 23:07:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-09-30 23:07:14,989 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-09-30 23:07:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:14,990 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-09-30 23:07:14,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-09-30 23:07:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:14,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:14,990 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:14,991 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:14,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:14,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-09-30 23:07:14,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:14,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:14,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:14,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:14,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:15,086 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:15,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:15,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:15,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:15,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:15,088 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-09-30 23:07:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:18,111 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-09-30 23:07:18,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:07:18,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:07:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:18,117 INFO L225 Difference]: With dead ends: 1325 [2018-09-30 23:07:18,117 INFO L226 Difference]: Without dead ends: 1317 [2018-09-30 23:07:18,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:07:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-09-30 23:07:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-09-30 23:07:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-09-30 23:07:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-09-30 23:07:18,461 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-09-30 23:07:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:18,462 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-09-30 23:07:18,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-09-30 23:07:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:18,462 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:18,463 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:18,463 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:18,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-30 23:07:18,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:18,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:18,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:18,537 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:18,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:18,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:18,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:18,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:18,539 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-09-30 23:07:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:22,086 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-09-30 23:07:22,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 23:07:22,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:07:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:22,092 INFO L225 Difference]: With dead ends: 1334 [2018-09-30 23:07:22,092 INFO L226 Difference]: Without dead ends: 1326 [2018-09-30 23:07:22,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-30 23:07:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-09-30 23:07:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-09-30 23:07:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-30 23:07:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-09-30 23:07:22,450 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-09-30 23:07:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:22,450 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-09-30 23:07:22,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-09-30 23:07:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:22,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:22,451 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:22,451 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:22,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-09-30 23:07:22,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:22,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:22,526 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:22,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:22,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:22,527 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-09-30 23:07:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:24,586 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-09-30 23:07:24,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:07:24,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:07:24,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:24,592 INFO L225 Difference]: With dead ends: 919 [2018-09-30 23:07:24,592 INFO L226 Difference]: Without dead ends: 911 [2018-09-30 23:07:24,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:07:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-09-30 23:07:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-09-30 23:07:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 23:07:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-09-30 23:07:24,962 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-09-30 23:07:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:24,962 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-09-30 23:07:24,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-09-30 23:07:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:24,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:24,963 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:24,963 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:24,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:24,963 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-09-30 23:07:24,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:24,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:24,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:25,051 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:25,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:25,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:25,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:25,051 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-09-30 23:07:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:27,700 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-09-30 23:07:27,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:07:27,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:07:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:27,706 INFO L225 Difference]: With dead ends: 1095 [2018-09-30 23:07:27,706 INFO L226 Difference]: Without dead ends: 1087 [2018-09-30 23:07:27,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:07:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-09-30 23:07:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-09-30 23:07:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-30 23:07:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-09-30 23:07:28,082 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-09-30 23:07:28,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:28,082 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-09-30 23:07:28,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-09-30 23:07:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:28,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:28,083 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:28,084 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:28,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-09-30 23:07:28,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:28,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:28,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:28,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:28,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:28,164 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:28,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:28,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:28,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:28,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:28,165 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-09-30 23:07:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:32,009 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-09-30 23:07:32,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 23:07:32,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:07:32,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:32,013 INFO L225 Difference]: With dead ends: 1304 [2018-09-30 23:07:32,013 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 23:07:32,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-30 23:07:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 23:07:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-09-30 23:07:32,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-09-30 23:07:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-09-30 23:07:32,387 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-09-30 23:07:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:32,387 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-09-30 23:07:32,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-09-30 23:07:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 23:07:32,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:32,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:32,389 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:32,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:32,389 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-30 23:07:32,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:32,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:32,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:32,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:32,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:32,465 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:32,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:32,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:32,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:32,466 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-09-30 23:07:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:35,948 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-09-30 23:07:35,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 23:07:35,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 23:07:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:35,952 INFO L225 Difference]: With dead ends: 1192 [2018-09-30 23:07:35,952 INFO L226 Difference]: Without dead ends: 1184 [2018-09-30 23:07:35,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-30 23:07:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-09-30 23:07:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-09-30 23:07:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 23:07:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-30 23:07:36,459 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-30 23:07:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:36,459 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-30 23:07:36,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-30 23:07:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 23:07:36,460 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:36,460 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:36,460 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:36,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-09-30 23:07:36,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:36,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:36,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:36,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:36,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:36,499 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:36,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:07:36,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:07:36,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:07:36,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:07:36,501 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-30 23:07:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:37,332 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-09-30 23:07:37,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:07:37,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 23:07:37,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:37,333 INFO L225 Difference]: With dead ends: 1139 [2018-09-30 23:07:37,334 INFO L226 Difference]: Without dead ends: 625 [2018-09-30 23:07:37,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-09-30 23:07:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-09-30 23:07:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 23:07:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-09-30 23:07:37,797 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-09-30 23:07:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:37,797 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-09-30 23:07:37,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:07:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-09-30 23:07:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 23:07:37,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:37,798 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:37,798 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:37,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:37,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-09-30 23:07:37,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:37,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:37,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:37,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:37,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:37,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:07:37,972 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:07:37,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:38,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:07:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:39,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:07:39,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 23:07:39,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 23:07:39,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 23:07:39,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:07:39,074 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-09-30 23:07:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:42,425 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-09-30 23:07:42,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:07:42,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-30 23:07:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:42,427 INFO L225 Difference]: With dead ends: 794 [2018-09-30 23:07:42,427 INFO L226 Difference]: Without dead ends: 789 [2018-09-30 23:07:42,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-30 23:07:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-30 23:07:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-09-30 23:07:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-30 23:07:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-09-30 23:07:43,150 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-09-30 23:07:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:43,150 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-09-30 23:07:43,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 23:07:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-09-30 23:07:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 23:07:43,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:43,151 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:43,151 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:43,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:43,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-09-30 23:07:43,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:43,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:43,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:43,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:43,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:43,216 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:43,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:07:43,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:07:43,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:07:43,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:07:43,217 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-09-30 23:07:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:44,711 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-09-30 23:07:44,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:07:44,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 23:07:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:44,713 INFO L225 Difference]: With dead ends: 1317 [2018-09-30 23:07:44,713 INFO L226 Difference]: Without dead ends: 729 [2018-09-30 23:07:44,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-09-30 23:07:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-09-30 23:07:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 23:07:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-30 23:07:45,367 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-30 23:07:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:45,367 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-30 23:07:45,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:07:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-30 23:07:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:07:45,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:45,368 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:45,369 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:45,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-09-30 23:07:45,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:45,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:45,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:45,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:45,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:45,486 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:45,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:45,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:45,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:45,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:45,487 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-09-30 23:07:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:48,864 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-09-30 23:07:48,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:07:48,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:07:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:48,868 INFO L225 Difference]: With dead ends: 1435 [2018-09-30 23:07:48,868 INFO L226 Difference]: Without dead ends: 1427 [2018-09-30 23:07:48,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:07:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-09-30 23:07:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-09-30 23:07:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-30 23:07:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-09-30 23:07:49,822 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-09-30 23:07:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:49,822 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-09-30 23:07:49,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-09-30 23:07:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:07:49,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:49,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:49,824 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:49,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:49,824 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-09-30 23:07:49,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:49,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:49,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:49,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:49,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:50,121 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:50,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:50,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:50,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:50,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:50,122 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-09-30 23:07:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:53,750 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-09-30 23:07:53,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 23:07:53,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:07:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:53,756 INFO L225 Difference]: With dead ends: 1599 [2018-09-30 23:07:53,756 INFO L226 Difference]: Without dead ends: 1591 [2018-09-30 23:07:53,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:07:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-30 23:07:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-09-30 23:07:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-30 23:07:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-09-30 23:07:54,761 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-09-30 23:07:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:54,761 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-09-30 23:07:54,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-09-30 23:07:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:07:54,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:54,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:54,763 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:54,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:54,763 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-09-30 23:07:54,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:54,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:54,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:54,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:54,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:54,856 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:54,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:54,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:54,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:54,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:54,857 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-09-30 23:07:58,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:58,049 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-09-30 23:07:58,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:07:58,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:07:58,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:58,053 INFO L225 Difference]: With dead ends: 1411 [2018-09-30 23:07:58,053 INFO L226 Difference]: Without dead ends: 1403 [2018-09-30 23:07:58,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:07:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-09-30 23:07:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-09-30 23:07:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-09-30 23:07:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-09-30 23:07:58,864 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-09-30 23:07:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:58,864 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-09-30 23:07:58,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:58,865 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-09-30 23:07:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:07:58,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:58,865 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:58,866 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:58,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-09-30 23:07:58,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:58,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:58,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:58,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:58,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:59,001 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:59,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:07:59,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:59,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:59,002 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-09-30 23:08:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:02,603 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-09-30 23:08:02,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 23:08:02,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:08:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:02,606 INFO L225 Difference]: With dead ends: 1490 [2018-09-30 23:08:02,606 INFO L226 Difference]: Without dead ends: 1482 [2018-09-30 23:08:02,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-30 23:08:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-30 23:08:03,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-09-30 23:08:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-30 23:08:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-09-30 23:08:03,514 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-09-30 23:08:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:03,514 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-09-30 23:08:03,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-09-30 23:08:03,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:03,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:03,515 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:03,516 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:03,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:03,516 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-09-30 23:08:03,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:03,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:03,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:03,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:03,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:03,589 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:03,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:08:03,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:03,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:03,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:03,590 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-09-30 23:08:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:07,005 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-09-30 23:08:07,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:08:07,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:08:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:07,007 INFO L225 Difference]: With dead ends: 1427 [2018-09-30 23:08:07,007 INFO L226 Difference]: Without dead ends: 1419 [2018-09-30 23:08:07,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:08:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-09-30 23:08:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-09-30 23:08:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-09-30 23:08:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-09-30 23:08:07,904 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-09-30 23:08:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:07,904 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-09-30 23:08:07,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-09-30 23:08:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:07,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:07,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:07,905 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:07,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-09-30 23:08:07,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:07,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:07,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:07,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:07,977 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:07,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:08:07,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:07,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:07,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:07,978 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-09-30 23:08:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:11,193 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-09-30 23:08:11,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 23:08:11,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:08:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:11,195 INFO L225 Difference]: With dead ends: 1306 [2018-09-30 23:08:11,195 INFO L226 Difference]: Without dead ends: 1298 [2018-09-30 23:08:11,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:08:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-09-30 23:08:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-09-30 23:08:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-30 23:08:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-09-30 23:08:12,254 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-09-30 23:08:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:12,254 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-09-30 23:08:12,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-09-30 23:08:12,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:12,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:12,255 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:12,255 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:12,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:12,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-09-30 23:08:12,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:12,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:08:12,319 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:08:12,319 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:08:12,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:12,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:08:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:08:12,371 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:08:12,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:08:12,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:12,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:12,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:12,372 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-09-30 23:08:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:15,489 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-09-30 23:08:15,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:08:15,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:08:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:15,491 INFO L225 Difference]: With dead ends: 1285 [2018-09-30 23:08:15,492 INFO L226 Difference]: Without dead ends: 1277 [2018-09-30 23:08:15,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-09-30 23:08:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-09-30 23:08:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-09-30 23:08:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-30 23:08:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-09-30 23:08:16,494 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-09-30 23:08:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:16,494 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-09-30 23:08:16,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-09-30 23:08:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:16,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:16,495 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:16,495 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:16,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-09-30 23:08:16,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:16,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:16,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:16,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:08:16,568 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:08:16,568 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:08:16,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:16,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:08:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:08:16,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:08:16,620 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:08:16,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:16,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:16,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:16,621 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-09-30 23:08:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:20,296 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-09-30 23:08:20,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 23:08:20,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:08:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:20,298 INFO L225 Difference]: With dead ends: 1518 [2018-09-30 23:08:20,298 INFO L226 Difference]: Without dead ends: 1510 [2018-09-30 23:08:20,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-09-30 23:08:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-30 23:08:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-09-30 23:08:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-09-30 23:08:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-09-30 23:08:21,386 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-09-30 23:08:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:21,386 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-09-30 23:08:21,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-09-30 23:08:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:21,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:21,387 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:21,387 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:21,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:21,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-09-30 23:08:21,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:21,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:21,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:21,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:21,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:08:21,479 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:08:21,479 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:08:21,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:21,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:08:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:08:21,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:08:21,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:08:21,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:21,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:21,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:21,533 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-09-30 23:08:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:25,170 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-09-30 23:08:25,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 23:08:25,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:08:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:25,184 INFO L225 Difference]: With dead ends: 1448 [2018-09-30 23:08:25,184 INFO L226 Difference]: Without dead ends: 1440 [2018-09-30 23:08:25,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-09-30 23:08:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-09-30 23:08:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-09-30 23:08:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-09-30 23:08:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-09-30 23:08:26,159 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-09-30 23:08:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:26,159 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-09-30 23:08:26,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-09-30 23:08:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:26,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:26,160 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:26,161 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:26,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-09-30 23:08:26,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:26,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:26,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:26,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:08:26,762 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:08:26,762 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:08:26,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:26,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:08:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:08:26,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:08:26,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 23:08:26,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:26,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:26,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:26,839 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-09-30 23:08:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:29,879 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-09-30 23:08:29,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:08:29,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 23:08:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:29,881 INFO L225 Difference]: With dead ends: 1254 [2018-09-30 23:08:29,881 INFO L226 Difference]: Without dead ends: 1246 [2018-09-30 23:08:29,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:08:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-09-30 23:08:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-09-30 23:08:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-30 23:08:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-09-30 23:08:30,827 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-09-30 23:08:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:30,828 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-09-30 23:08:30,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-09-30 23:08:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:30,829 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:30,829 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:30,829 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:30,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-09-30 23:08:30,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:30,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:30,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:30,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:30,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:30,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:30,904 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:08:30,904 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:08:30,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:30,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:08:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:31,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:08:31,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 23:08:31,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:08:31,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:08:31,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:08:31,253 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-09-30 23:08:35,446 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 23:08:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:37,133 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-09-30 23:08:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 23:08:37,133 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:08:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:37,135 INFO L225 Difference]: With dead ends: 1278 [2018-09-30 23:08:37,135 INFO L226 Difference]: Without dead ends: 1270 [2018-09-30 23:08:37,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 23:08:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-09-30 23:08:38,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-09-30 23:08:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-09-30 23:08:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-09-30 23:08:38,276 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-09-30 23:08:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:38,276 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-09-30 23:08:38,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:08:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-09-30 23:08:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:38,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:38,276 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:38,277 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:38,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-09-30 23:08:38,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:38,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:38,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:38,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:38,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:38,355 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:38,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 23:08:38,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:08:38,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:08:38,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:08:38,356 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-09-30 23:08:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:41,712 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-09-30 23:08:41,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 23:08:41,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 23:08:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:41,714 INFO L225 Difference]: With dead ends: 1180 [2018-09-30 23:08:41,714 INFO L226 Difference]: Without dead ends: 1172 [2018-09-30 23:08:41,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:08:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-09-30 23:08:42,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-09-30 23:08:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-09-30 23:08:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-09-30 23:08:42,829 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-09-30 23:08:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:42,829 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-09-30 23:08:42,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:08:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-09-30 23:08:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:42,830 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:42,830 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:42,831 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:42,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:42,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-09-30 23:08:42,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:42,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:42,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:42,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:42,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:43,413 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:43,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 23:08:43,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:08:43,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:08:43,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:08:43,415 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-09-30 23:08:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:47,129 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-09-30 23:08:47,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 23:08:47,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 23:08:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:47,131 INFO L225 Difference]: With dead ends: 1233 [2018-09-30 23:08:47,131 INFO L226 Difference]: Without dead ends: 1225 [2018-09-30 23:08:47,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-09-30 23:08:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-09-30 23:08:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-09-30 23:08:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-09-30 23:08:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-09-30 23:08:48,283 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-09-30 23:08:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:48,284 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-09-30 23:08:48,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:08:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-09-30 23:08:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:48,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:48,285 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:48,285 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:48,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-09-30 23:08:48,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:48,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:48,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:48,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:48,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:48,359 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:48,359 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 23:08:48,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:08:48,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:08:48,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:08:48,360 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-09-30 23:08:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:52,753 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-09-30 23:08:52,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 23:08:52,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 23:08:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:52,755 INFO L225 Difference]: With dead ends: 1537 [2018-09-30 23:08:52,755 INFO L226 Difference]: Without dead ends: 1529 [2018-09-30 23:08:52,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 23:08:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-09-30 23:08:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-09-30 23:08:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-30 23:08:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-09-30 23:08:53,938 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-09-30 23:08:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:53,938 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-09-30 23:08:53,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:08:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-09-30 23:08:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:53,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:53,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:53,939 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:53,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:53,939 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-09-30 23:08:53,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:53,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:53,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:53,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:53,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:54,058 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:54,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 23:08:54,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:08:54,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:08:54,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:08:54,059 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-09-30 23:08:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:58,719 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-09-30 23:08:58,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 23:08:58,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 23:08:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:58,722 INFO L225 Difference]: With dead ends: 1590 [2018-09-30 23:08:58,722 INFO L226 Difference]: Without dead ends: 1582 [2018-09-30 23:08:58,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-09-30 23:08:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-30 23:08:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-09-30 23:08:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-09-30 23:08:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-09-30 23:08:59,929 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-09-30 23:08:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:59,929 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-09-30 23:08:59,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:08:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-09-30 23:08:59,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:08:59,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:59,930 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:59,930 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:59,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-09-30 23:08:59,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:59,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:59,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:00,008 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:09:00,009 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:09:00,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:00,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:09:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:00,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:09:00,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 23:09:00,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:09:00,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:09:00,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:09:00,164 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-09-30 23:09:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:10,016 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-09-30 23:09:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-30 23:09:10,017 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:09:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:10,019 INFO L225 Difference]: With dead ends: 1949 [2018-09-30 23:09:10,019 INFO L226 Difference]: Without dead ends: 1941 [2018-09-30 23:09:10,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1453, Invalid=7667, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 23:09:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-09-30 23:09:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-09-30 23:09:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-09-30 23:09:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-09-30 23:09:11,456 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-09-30 23:09:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:11,457 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-09-30 23:09:11,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:09:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-09-30 23:09:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:09:11,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:11,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:11,458 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:11,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-09-30 23:09:11,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:11,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:11,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:11,567 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:09:11,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-30 23:09:11,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:09:11,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:09:11,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:09:11,568 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-09-30 23:09:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:15,843 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-09-30 23:09:15,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 23:09:15,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-30 23:09:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:15,855 INFO L225 Difference]: With dead ends: 1420 [2018-09-30 23:09:15,855 INFO L226 Difference]: Without dead ends: 1412 [2018-09-30 23:09:15,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-09-30 23:09:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-09-30 23:09:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-09-30 23:09:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-09-30 23:09:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-09-30 23:09:17,072 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-09-30 23:09:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:17,072 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-09-30 23:09:17,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:09:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-09-30 23:09:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:09:17,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:17,073 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:17,073 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:17,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-09-30 23:09:17,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:17,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:17,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:17,150 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:09:17,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:09:17,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:17,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:09:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:17,305 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:09:17,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 23:09:17,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:09:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:09:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:09:17,306 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-09-30 23:09:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:30,346 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-09-30 23:09:30,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-30 23:09:30,346 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:09:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:30,349 INFO L225 Difference]: With dead ends: 2767 [2018-09-30 23:09:30,349 INFO L226 Difference]: Without dead ends: 2759 [2018-09-30 23:09:30,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6116 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2425, Invalid=14867, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 23:09:30,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-30 23:09:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-09-30 23:09:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-09-30 23:09:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-09-30 23:09:31,756 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-09-30 23:09:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:31,756 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-09-30 23:09:31,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:09:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-09-30 23:09:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 23:09:31,757 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:31,757 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:31,758 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:31,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:31,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-09-30 23:09:31,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:31,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:31,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:31,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:31,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:31,899 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:09:31,899 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:09:31,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:31,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:09:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:32,213 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:09:32,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 23:09:32,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:09:32,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:09:32,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:09:32,214 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-09-30 23:09:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:45,981 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-09-30 23:09:45,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-30 23:09:45,982 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 23:09:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:45,984 INFO L225 Difference]: With dead ends: 2361 [2018-09-30 23:09:45,985 INFO L226 Difference]: Without dead ends: 2353 [2018-09-30 23:09:45,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9524 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3069, Invalid=22371, Unknown=0, NotChecked=0, Total=25440 [2018-09-30 23:09:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-09-30 23:09:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-09-30 23:09:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-09-30 23:09:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-09-30 23:09:47,630 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-09-30 23:09:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:47,630 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-09-30 23:09:47,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:09:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-09-30 23:09:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 23:09:47,631 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:47,631 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:47,631 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:47,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:47,632 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-09-30 23:09:47,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:47,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:47,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:47,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:47,751 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:09:47,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:09:47,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:47,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:09:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:47,863 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:09:47,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 23:09:47,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:09:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:09:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:09:47,864 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-09-30 23:09:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:50,749 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-09-30 23:09:50,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 23:09:50,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-09-30 23:09:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:50,751 INFO L225 Difference]: With dead ends: 1507 [2018-09-30 23:09:50,751 INFO L226 Difference]: Without dead ends: 1502 [2018-09-30 23:09:50,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:09:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-09-30 23:09:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-09-30 23:09:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-09-30 23:09:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-09-30 23:09:52,775 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-09-30 23:09:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:52,775 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-09-30 23:09:52,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:09:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-09-30 23:09:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 23:09:52,776 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:52,776 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:52,776 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:52,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:52,777 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-09-30 23:09:52,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:52,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:52,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:52,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:52,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:52,951 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:09:52,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:09:52,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:52,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:09:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:53,583 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:09:53,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-09-30 23:09:53,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:09:53,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:09:53,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:09:53,584 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-09-30 23:09:54,070 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-30 23:10:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:04,117 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-09-30 23:10:04,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 23:10:04,118 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-09-30 23:10:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:04,122 INFO L225 Difference]: With dead ends: 3654 [2018-09-30 23:10:04,122 INFO L226 Difference]: Without dead ends: 3646 [2018-09-30 23:10:04,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1127, Invalid=3703, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 23:10:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-09-30 23:10:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-09-30 23:10:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-09-30 23:10:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-09-30 23:10:06,977 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-09-30 23:10:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:06,977 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-09-30 23:10:06,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 23:10:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-09-30 23:10:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:10:06,978 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:06,978 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:06,978 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:06,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:06,979 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-09-30 23:10:06,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:06,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:06,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:06,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:06,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:07,067 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:07,067 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:07,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:07,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:07,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:07,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:10:07,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:10:07,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:10:07,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:10:07,140 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-09-30 23:10:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:12,799 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-09-30 23:10:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:10:12,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:10:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:12,802 INFO L225 Difference]: With dead ends: 2767 [2018-09-30 23:10:12,802 INFO L226 Difference]: Without dead ends: 2759 [2018-09-30 23:10:12,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:10:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-30 23:10:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-09-30 23:10:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-09-30 23:10:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-09-30 23:10:15,745 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-09-30 23:10:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:15,746 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-09-30 23:10:15,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:10:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-09-30 23:10:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:10:15,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:15,747 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:15,747 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:15,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:15,747 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-09-30 23:10:15,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:15,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:15,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:15,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:15,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:15,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:15,827 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:15,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:15,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:15,901 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:15,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:10:15,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:10:15,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:10:15,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:10:15,902 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-09-30 23:10:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:22,232 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-09-30 23:10:22,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:10:22,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:10:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:22,236 INFO L225 Difference]: With dead ends: 3146 [2018-09-30 23:10:22,236 INFO L226 Difference]: Without dead ends: 3138 [2018-09-30 23:10:22,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:10:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-09-30 23:10:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-09-30 23:10:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-09-30 23:10:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-09-30 23:10:25,349 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-09-30 23:10:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:25,349 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-09-30 23:10:25,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:10:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-09-30 23:10:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:10:25,350 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:25,350 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:25,350 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:25,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-09-30 23:10:25,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:25,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:25,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:25,442 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:25,442 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:25,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:25,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:25,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:25,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:10:25,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:10:25,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:10:25,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:10:25,514 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-09-30 23:10:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:32,284 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-09-30 23:10:32,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 23:10:32,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:10:32,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:32,288 INFO L225 Difference]: With dead ends: 3089 [2018-09-30 23:10:32,288 INFO L226 Difference]: Without dead ends: 3081 [2018-09-30 23:10:32,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:10:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-09-30 23:10:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-09-30 23:10:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-09-30 23:10:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-09-30 23:10:35,274 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-09-30 23:10:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:35,275 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-09-30 23:10:35,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:10:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-09-30 23:10:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:10:35,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:35,276 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:35,276 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:35,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:35,277 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-09-30 23:10:35,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:35,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:35,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:35,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:35,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:35,363 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:35,363 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:35,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:35,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:35,428 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:35,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:10:35,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:10:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:10:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:10:35,429 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. [2018-09-30 23:10:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:42,094 INFO L93 Difference]: Finished difference Result 3266 states and 7250 transitions. [2018-09-30 23:10:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:10:42,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:10:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:42,098 INFO L225 Difference]: With dead ends: 3266 [2018-09-30 23:10:42,098 INFO L226 Difference]: Without dead ends: 3258 [2018-09-30 23:10:42,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-09-30 23:10:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2018-09-30 23:10:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2328. [2018-09-30 23:10:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-09-30 23:10:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 5263 transitions. [2018-09-30 23:10:45,289 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 5263 transitions. Word has length 20 [2018-09-30 23:10:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:45,289 INFO L480 AbstractCegarLoop]: Abstraction has 2328 states and 5263 transitions. [2018-09-30 23:10:45,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:10:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 5263 transitions. [2018-09-30 23:10:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:10:45,290 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:45,290 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:45,290 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:45,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:45,291 INFO L82 PathProgramCache]: Analyzing trace with hash 718975582, now seen corresponding path program 1 times [2018-09-30 23:10:45,291 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:45,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:45,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:45,377 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:45,377 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:45,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:45,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:45,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:45,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:10:45,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:10:45,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:10:45,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:10:45,451 INFO L87 Difference]: Start difference. First operand 2328 states and 5263 transitions. Second operand 11 states. [2018-09-30 23:10:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:53,175 INFO L93 Difference]: Finished difference Result 3498 states and 7776 transitions. [2018-09-30 23:10:53,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:10:53,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:10:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:53,179 INFO L225 Difference]: With dead ends: 3498 [2018-09-30 23:10:53,179 INFO L226 Difference]: Without dead ends: 3490 [2018-09-30 23:10:53,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2018-09-30 23:10:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2018-09-30 23:10:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2262. [2018-09-30 23:10:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-09-30 23:10:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5119 transitions. [2018-09-30 23:10:56,200 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5119 transitions. Word has length 20 [2018-09-30 23:10:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:56,200 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 5119 transitions. [2018-09-30 23:10:56,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:10:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5119 transitions. [2018-09-30 23:10:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:10:56,201 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:56,201 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:56,202 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:56,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:56,202 INFO L82 PathProgramCache]: Analyzing trace with hash 826825729, now seen corresponding path program 1 times [2018-09-30 23:10:56,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:56,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:56,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:56,823 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:10:56,823 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:10:56,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:56,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:10:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:10:56,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:10:56,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:10:56,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:10:56,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:10:56,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:10:56,892 INFO L87 Difference]: Start difference. First operand 2262 states and 5119 transitions. Second operand 11 states. [2018-09-30 23:11:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:03,944 INFO L93 Difference]: Finished difference Result 3139 states and 7021 transitions. [2018-09-30 23:11:03,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:11:03,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:11:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:03,947 INFO L225 Difference]: With dead ends: 3139 [2018-09-30 23:11:03,947 INFO L226 Difference]: Without dead ends: 3131 [2018-09-30 23:11:03,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2018-09-30 23:11:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2018-09-30 23:11:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2262. [2018-09-30 23:11:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-09-30 23:11:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5119 transitions. [2018-09-30 23:11:07,067 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5119 transitions. Word has length 20 [2018-09-30 23:11:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:07,068 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 5119 transitions. [2018-09-30 23:11:07,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:11:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5119 transitions. [2018-09-30 23:11:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:11:07,069 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:07,069 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:07,069 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:07,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1854611284, now seen corresponding path program 1 times [2018-09-30 23:11:07,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:07,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:07,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:07,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:07,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:11:07,355 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:11:07,355 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:11:07,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:07,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:11:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:11:07,412 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:11:07,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:11:07,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:11:07,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:11:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:11:07,413 INFO L87 Difference]: Start difference. First operand 2262 states and 5119 transitions. Second operand 11 states. [2018-09-30 23:11:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:13,377 INFO L93 Difference]: Finished difference Result 2951 states and 6564 transitions. [2018-09-30 23:11:13,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:11:13,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:11:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:13,381 INFO L225 Difference]: With dead ends: 2951 [2018-09-30 23:11:13,381 INFO L226 Difference]: Without dead ends: 2943 [2018-09-30 23:11:13,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:11:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2018-09-30 23:11:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2202. [2018-09-30 23:11:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-09-30 23:11:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 4975 transitions. [2018-09-30 23:11:16,398 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 4975 transitions. Word has length 20 [2018-09-30 23:11:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:16,398 INFO L480 AbstractCegarLoop]: Abstraction has 2202 states and 4975 transitions. [2018-09-30 23:11:16,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:11:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 4975 transitions. [2018-09-30 23:11:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:11:16,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:16,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:16,400 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:16,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:16,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1854713429, now seen corresponding path program 1 times [2018-09-30 23:11:16,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:16,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:16,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:16,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:16,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:11:16,494 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:11:16,494 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:11:16,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:16,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:11:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:11:16,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:11:16,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:11:16,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:11:16,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:11:16,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:11:16,578 INFO L87 Difference]: Start difference. First operand 2202 states and 4975 transitions. Second operand 11 states. [2018-09-30 23:11:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:24,001 INFO L93 Difference]: Finished difference Result 3183 states and 7090 transitions. [2018-09-30 23:11:24,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 23:11:24,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:11:24,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:24,005 INFO L225 Difference]: With dead ends: 3183 [2018-09-30 23:11:24,005 INFO L226 Difference]: Without dead ends: 3175 [2018-09-30 23:11:24,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:11:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2018-09-30 23:11:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2136. [2018-09-30 23:11:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-09-30 23:11:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4831 transitions. [2018-09-30 23:11:27,311 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4831 transitions. Word has length 20 [2018-09-30 23:11:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:27,311 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4831 transitions. [2018-09-30 23:11:27,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:11:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4831 transitions. [2018-09-30 23:11:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 23:11:27,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:27,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:27,313 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:27,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:27,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1962563576, now seen corresponding path program 1 times [2018-09-30 23:11:27,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:27,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:27,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:27,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:27,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:11:27,435 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:11:27,435 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:11:27,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:27,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:11:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:11:27,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:11:27,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-30 23:11:27,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:11:27,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:11:27,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:11:27,525 INFO L87 Difference]: Start difference. First operand 2136 states and 4831 transitions. Second operand 11 states. [2018-09-30 23:11:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:34,893 INFO L93 Difference]: Finished difference Result 3044 states and 6774 transitions. [2018-09-30 23:11:34,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:11:34,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-30 23:11:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:34,896 INFO L225 Difference]: With dead ends: 3044 [2018-09-30 23:11:34,896 INFO L226 Difference]: Without dead ends: 3036 [2018-09-30 23:11:34,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2018-09-30 23:11:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2018-09-30 23:11:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 1834. [2018-09-30 23:11:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2018-09-30 23:11:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 4141 transitions. [2018-09-30 23:11:37,539 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 4141 transitions. Word has length 20 [2018-09-30 23:11:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:37,539 INFO L480 AbstractCegarLoop]: Abstraction has 1834 states and 4141 transitions. [2018-09-30 23:11:37,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:11:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 4141 transitions. [2018-09-30 23:11:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 23:11:37,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:37,540 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:37,541 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:37,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:37,541 INFO L82 PathProgramCache]: Analyzing trace with hash 371911669, now seen corresponding path program 1 times [2018-09-30 23:11:37,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:37,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:37,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:37,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:37,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:11:37,636 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:11:37,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:11:37,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:37,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:11:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:11:37,810 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:11:37,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 23:11:37,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 23:11:37,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 23:11:37,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:11:37,811 INFO L87 Difference]: Start difference. First operand 1834 states and 4141 transitions. Second operand 20 states. [2018-09-30 23:11:38,323 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-30 23:12:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:12:00,577 INFO L93 Difference]: Finished difference Result 5972 states and 13233 transitions. [2018-09-30 23:12:00,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-30 23:12:00,577 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-09-30 23:12:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:12:00,584 INFO L225 Difference]: With dead ends: 5972 [2018-09-30 23:12:00,584 INFO L226 Difference]: Without dead ends: 5964 [2018-09-30 23:12:00,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6291 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2488, Invalid=14282, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 23:12:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2018-09-30 23:12:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3311. [2018-09-30 23:12:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2018-09-30 23:12:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 7569 transitions. [2018-09-30 23:12:05,771 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 7569 transitions. Word has length 21 [2018-09-30 23:12:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:12:05,772 INFO L480 AbstractCegarLoop]: Abstraction has 3311 states and 7569 transitions. [2018-09-30 23:12:05,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 23:12:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 7569 transitions. [2018-09-30 23:12:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 23:12:05,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:12:05,773 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:12:05,773 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:12:05,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:12:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash -461254251, now seen corresponding path program 2 times [2018-09-30 23:12:05,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:12:05,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:12:05,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:05,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:05,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:05,899 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:12:05,899 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:12:05,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:12:05,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:12:05,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:12:05,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:12:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:06,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:12:06,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-30 23:12:06,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 23:12:06,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 23:12:06,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-09-30 23:12:06,090 INFO L87 Difference]: Start difference. First operand 3311 states and 7569 transitions. Second operand 21 states. [2018-09-30 23:12:09,868 WARN L178 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-09-30 23:12:18,128 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 23:12:23,268 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-09-30 23:12:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:12:29,653 INFO L93 Difference]: Finished difference Result 6725 states and 15108 transitions. [2018-09-30 23:12:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-30 23:12:29,654 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-30 23:12:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:12:29,661 INFO L225 Difference]: With dead ends: 6725 [2018-09-30 23:12:29,661 INFO L226 Difference]: Without dead ends: 6717 [2018-09-30 23:12:29,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3418 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1813, Invalid=8899, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 23:12:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2018-09-30 23:12:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 2426. [2018-09-30 23:12:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2018-09-30 23:12:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 5536 transitions. [2018-09-30 23:12:33,540 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 5536 transitions. Word has length 21 [2018-09-30 23:12:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:12:33,540 INFO L480 AbstractCegarLoop]: Abstraction has 2426 states and 5536 transitions. [2018-09-30 23:12:33,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 23:12:33,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 5536 transitions. [2018-09-30 23:12:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:12:33,542 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:12:33,542 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:12:33,542 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:12:33,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:12:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash 504785992, now seen corresponding path program 1 times [2018-09-30 23:12:33,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:12:33,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:12:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:33,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:12:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:33,629 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:12:33,629 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:12:33,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:33,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:12:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:33,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:12:33,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-09-30 23:12:33,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 23:12:33,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 23:12:33,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-09-30 23:12:33,748 INFO L87 Difference]: Start difference. First operand 2426 states and 5536 transitions. Second operand 13 states. [2018-09-30 23:12:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:12:46,639 INFO L93 Difference]: Finished difference Result 8061 states and 18335 transitions. [2018-09-30 23:12:46,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 23:12:46,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-09-30 23:12:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:12:46,646 INFO L225 Difference]: With dead ends: 8061 [2018-09-30 23:12:46,646 INFO L226 Difference]: Without dead ends: 5636 [2018-09-30 23:12:46,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=1305, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 23:12:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2018-09-30 23:12:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 3316. [2018-09-30 23:12:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2018-09-30 23:12:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 7500 transitions. [2018-09-30 23:12:52,410 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 7500 transitions. Word has length 24 [2018-09-30 23:12:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:12:52,410 INFO L480 AbstractCegarLoop]: Abstraction has 3316 states and 7500 transitions. [2018-09-30 23:12:52,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 23:12:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 7500 transitions. [2018-09-30 23:12:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:12:52,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:12:52,412 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:12:52,412 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:12:52,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:12:52,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1269424552, now seen corresponding path program 1 times [2018-09-30 23:12:52,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:12:52,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:12:52,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:52,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:52,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:52,484 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:12:52,484 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:12:52,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:52,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:12:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:52,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:12:52,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-09-30 23:12:52,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:12:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:12:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:12:52,643 INFO L87 Difference]: Start difference. First operand 3316 states and 7500 transitions. Second operand 14 states. [2018-09-30 23:13:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:06,063 INFO L93 Difference]: Finished difference Result 9123 states and 20565 transitions. [2018-09-30 23:13:06,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 23:13:06,064 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-30 23:13:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:06,070 INFO L225 Difference]: With dead ends: 9123 [2018-09-30 23:13:06,070 INFO L226 Difference]: Without dead ends: 5808 [2018-09-30 23:13:06,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=316, Invalid=1016, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 23:13:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5808 states. [2018-09-30 23:13:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5808 to 3396. [2018-09-30 23:13:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2018-09-30 23:13:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 7743 transitions. [2018-09-30 23:13:12,032 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 7743 transitions. Word has length 24 [2018-09-30 23:13:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:12,032 INFO L480 AbstractCegarLoop]: Abstraction has 3396 states and 7743 transitions. [2018-09-30 23:13:12,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:13:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 7743 transitions. [2018-09-30 23:13:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:13:12,033 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:12,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:12,034 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:12,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:12,034 INFO L82 PathProgramCache]: Analyzing trace with hash -277435291, now seen corresponding path program 1 times [2018-09-30 23:13:12,034 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:12,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:12,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:12,146 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:13:12,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:13:12,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:12,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:13:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:12,436 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:13:12,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-09-30 23:13:12,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 23:13:12,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 23:13:12,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-09-30 23:13:12,437 INFO L87 Difference]: Start difference. First operand 3396 states and 7743 transitions. Second operand 15 states. [2018-09-30 23:13:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:28,505 INFO L93 Difference]: Finished difference Result 9753 states and 22123 transitions. [2018-09-30 23:13:28,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 23:13:28,505 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-09-30 23:13:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:28,514 INFO L225 Difference]: With dead ends: 9753 [2018-09-30 23:13:28,515 INFO L226 Difference]: Without dead ends: 6358 [2018-09-30 23:13:28,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=589, Invalid=1763, Unknown=0, NotChecked=0, Total=2352 [2018-09-30 23:13:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6358 states. [2018-09-30 23:13:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6358 to 4049. [2018-09-30 23:13:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2018-09-30 23:13:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 9311 transitions. [2018-09-30 23:13:35,378 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 9311 transitions. Word has length 24 [2018-09-30 23:13:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:35,378 INFO L480 AbstractCegarLoop]: Abstraction has 4049 states and 9311 transitions. [2018-09-30 23:13:35,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 23:13:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 9311 transitions. [2018-09-30 23:13:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:13:35,380 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:35,380 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:35,380 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:35,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:35,381 INFO L82 PathProgramCache]: Analyzing trace with hash -290450663, now seen corresponding path program 1 times [2018-09-30 23:13:35,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:35,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:35,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:35,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:35,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:35,456 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:13:35,456 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:13:35,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:35,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:13:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:35,599 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:13:35,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-09-30 23:13:35,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 23:13:35,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 23:13:35,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-09-30 23:13:35,600 INFO L87 Difference]: Start difference. First operand 4049 states and 9311 transitions. Second operand 15 states. [2018-09-30 23:13:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:49,930 INFO L93 Difference]: Finished difference Result 10048 states and 22999 transitions. [2018-09-30 23:13:49,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 23:13:49,931 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-09-30 23:13:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:49,938 INFO L225 Difference]: With dead ends: 10048 [2018-09-30 23:13:49,938 INFO L226 Difference]: Without dead ends: 6000 [2018-09-30 23:13:49,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=560, Invalid=1602, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 23:13:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2018-09-30 23:13:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 4263. [2018-09-30 23:13:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2018-09-30 23:13:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 9793 transitions. [2018-09-30 23:13:56,846 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 9793 transitions. Word has length 24 [2018-09-30 23:13:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:56,847 INFO L480 AbstractCegarLoop]: Abstraction has 4263 states and 9793 transitions. [2018-09-30 23:13:56,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 23:13:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 9793 transitions. [2018-09-30 23:13:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:13:56,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:56,850 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:56,850 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:56,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash 481433400, now seen corresponding path program 1 times [2018-09-30 23:13:56,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:56,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:56,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:56,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:56,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:56,928 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:13:56,928 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:13:56,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:56,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:13:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:57,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:13:57,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-09-30 23:13:57,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:13:57,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:13:57,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:13:57,140 INFO L87 Difference]: Start difference. First operand 4263 states and 9793 transitions. Second operand 14 states. [2018-09-30 23:14:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:14:13,603 INFO L93 Difference]: Finished difference Result 11665 states and 26624 transitions. [2018-09-30 23:14:13,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 23:14:13,603 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-30 23:14:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:14:13,611 INFO L225 Difference]: With dead ends: 11665 [2018-09-30 23:14:13,611 INFO L226 Difference]: Without dead ends: 7403 [2018-09-30 23:14:13,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=439, Invalid=1367, Unknown=0, NotChecked=0, Total=1806 [2018-09-30 23:14:13,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7403 states. [2018-09-30 23:14:21,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7403 to 4888. [2018-09-30 23:14:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-09-30 23:14:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 11268 transitions. [2018-09-30 23:14:21,475 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 11268 transitions. Word has length 24 [2018-09-30 23:14:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:14:21,475 INFO L480 AbstractCegarLoop]: Abstraction has 4888 states and 11268 transitions. [2018-09-30 23:14:21,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:14:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 11268 transitions. [2018-09-30 23:14:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:14:21,479 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:14:21,479 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:14:21,479 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:14:21,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:14:21,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1900063568, now seen corresponding path program 1 times [2018-09-30 23:14:21,479 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:14:21,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:14:21,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:21,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:21,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:14:21,612 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:14:21,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:14:21,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:21,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:14:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:14:21,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:14:21,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-09-30 23:14:21,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:14:21,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:14:21,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:14:21,727 INFO L87 Difference]: Start difference. First operand 4888 states and 11268 transitions. Second operand 14 states. [2018-09-30 23:14:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:14:38,847 INFO L93 Difference]: Finished difference Result 12914 states and 29867 transitions. [2018-09-30 23:14:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 23:14:38,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-30 23:14:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:14:38,859 INFO L225 Difference]: With dead ends: 12914 [2018-09-30 23:14:38,859 INFO L226 Difference]: Without dead ends: 8027 [2018-09-30 23:14:38,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=498, Invalid=1482, Unknown=0, NotChecked=0, Total=1980 [2018-09-30 23:14:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8027 states. [2018-09-30 23:14:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8027 to 5552. [2018-09-30 23:14:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2018-09-30 23:14:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 12965 transitions. [2018-09-30 23:14:48,325 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 12965 transitions. Word has length 24 [2018-09-30 23:14:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:14:48,325 INFO L480 AbstractCegarLoop]: Abstraction has 5552 states and 12965 transitions. [2018-09-30 23:14:48,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:14:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 12965 transitions. [2018-09-30 23:14:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:14:48,328 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:14:48,328 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:14:48,328 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:14:48,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:14:48,329 INFO L82 PathProgramCache]: Analyzing trace with hash -563138598, now seen corresponding path program 1 times [2018-09-30 23:14:48,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:14:48,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:14:48,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:48,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:48,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:14:48,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:14:48,573 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:14:48,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:48,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:14:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:14:48,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:14:48,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-09-30 23:14:48,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 23:14:48,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 23:14:48,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:14:48,702 INFO L87 Difference]: Start difference. First operand 5552 states and 12965 transitions. Second operand 14 states. [2018-09-30 23:15:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:15:05,979 INFO L93 Difference]: Finished difference Result 13640 states and 31538 transitions. [2018-09-30 23:15:05,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 23:15:05,979 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-30 23:15:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:15:05,989 INFO L225 Difference]: With dead ends: 13640 [2018-09-30 23:15:05,989 INFO L226 Difference]: Without dead ends: 8089 [2018-09-30 23:15:05,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=546, Invalid=1616, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 23:15:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2018-09-30 23:15:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 5556. [2018-09-30 23:15:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2018-09-30 23:15:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 12957 transitions. [2018-09-30 23:15:15,194 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 12957 transitions. Word has length 24 [2018-09-30 23:15:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:15:15,194 INFO L480 AbstractCegarLoop]: Abstraction has 5556 states and 12957 transitions. [2018-09-30 23:15:15,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 23:15:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 12957 transitions. [2018-09-30 23:15:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:15:15,197 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:15:15,197 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:15:15,197 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:15:15,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:15:15,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1568457909, now seen corresponding path program 1 times [2018-09-30 23:15:15,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:15:15,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:15:15,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:15:15,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:15:15,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:15:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:15:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:15:15,755 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:15:15,755 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:15:15,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:15:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:15:15,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:15:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:15:15,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:15:15,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-09-30 23:15:15,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:15:15,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:15:15,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:15:15,901 INFO L87 Difference]: Start difference. First operand 5556 states and 12957 transitions. Second operand 19 states. [2018-09-30 23:15:22,553 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 23:16:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:16:13,751 INFO L93 Difference]: Finished difference Result 24779 states and 57605 transitions. [2018-09-30 23:16:13,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2018-09-30 23:16:13,751 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-09-30 23:16:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:16:13,775 INFO L225 Difference]: With dead ends: 24779 [2018-09-30 23:16:13,776 INFO L226 Difference]: Without dead ends: 19224 [2018-09-30 23:16:13,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38307 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=7513, Invalid=80399, Unknown=0, NotChecked=0, Total=87912 [2018-09-30 23:16:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19224 states. [2018-09-30 23:16:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19224 to 9944. [2018-09-30 23:16:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9944 states. [2018-09-30 23:16:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 23419 transitions. [2018-09-30 23:16:29,867 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 23419 transitions. Word has length 24 [2018-09-30 23:16:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:16:29,867 INFO L480 AbstractCegarLoop]: Abstraction has 9944 states and 23419 transitions. [2018-09-30 23:16:29,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 23:16:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 23419 transitions. [2018-09-30 23:16:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:16:29,871 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:16:29,871 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:16:29,871 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:16:29,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:16:29,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1340769778, now seen corresponding path program 1 times [2018-09-30 23:16:29,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:16:29,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:16:29,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:29,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:16:29,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:16:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:16:30,030 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:16:30,030 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:16:30,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:16:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:16:30,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:16:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:16:30,211 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:16:30,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-09-30 23:16:30,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:16:30,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:16:30,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:16:30,212 INFO L87 Difference]: Start difference. First operand 9944 states and 23419 transitions. Second operand 19 states. [2018-09-30 23:17:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:17:23,323 INFO L93 Difference]: Finished difference Result 32192 states and 74985 transitions. [2018-09-30 23:17:23,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-30 23:17:23,323 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-09-30 23:17:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:17:23,352 INFO L225 Difference]: With dead ends: 32192 [2018-09-30 23:17:23,352 INFO L226 Difference]: Without dead ends: 22249 [2018-09-30 23:17:23,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7788 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2403, Invalid=18477, Unknown=0, NotChecked=0, Total=20880 [2018-09-30 23:17:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22249 states. [2018-09-30 23:17:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22249 to 10853. [2018-09-30 23:17:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10853 states. [2018-09-30 23:17:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10853 states to 10853 states and 25572 transitions. [2018-09-30 23:17:42,105 INFO L78 Accepts]: Start accepts. Automaton has 10853 states and 25572 transitions. Word has length 24 [2018-09-30 23:17:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:17:42,105 INFO L480 AbstractCegarLoop]: Abstraction has 10853 states and 25572 transitions. [2018-09-30 23:17:42,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 23:17:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 10853 states and 25572 transitions. [2018-09-30 23:17:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:17:42,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:17:42,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:17:42,108 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:17:42,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:17:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1338856576, now seen corresponding path program 1 times [2018-09-30 23:17:42,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:17:42,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:17:42,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:17:42,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:17:42,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:17:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:17:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:17:42,233 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:17:42,233 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:17:42,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:17:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:17:42,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:17:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:17:42,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:17:42,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-09-30 23:17:42,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:17:42,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:17:42,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:17:42,421 INFO L87 Difference]: Start difference. First operand 10853 states and 25572 transitions. Second operand 19 states. [2018-09-30 23:18:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:18:17,788 INFO L93 Difference]: Finished difference Result 25628 states and 59763 transitions. [2018-09-30 23:18:17,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-30 23:18:17,789 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-09-30 23:18:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:18:17,806 INFO L225 Difference]: With dead ends: 25628 [2018-09-30 23:18:17,806 INFO L226 Difference]: Without dead ends: 14776 [2018-09-30 23:18:17,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=695, Invalid=5311, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 23:18:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14776 states. [2018-09-30 23:18:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14776 to 11098. [2018-09-30 23:18:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11098 states. [2018-09-30 23:18:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11098 states to 11098 states and 26149 transitions. [2018-09-30 23:18:36,537 INFO L78 Accepts]: Start accepts. Automaton has 11098 states and 26149 transitions. Word has length 24 [2018-09-30 23:18:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:18:36,537 INFO L480 AbstractCegarLoop]: Abstraction has 11098 states and 26149 transitions. [2018-09-30 23:18:36,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 23:18:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 11098 states and 26149 transitions. [2018-09-30 23:18:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:18:36,541 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:18:36,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:18:36,541 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:18:36,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:18:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash -440997654, now seen corresponding path program 1 times [2018-09-30 23:18:36,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:18:36,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:18:36,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:18:36,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:18:36,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:18:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:18:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:18:36,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:18:36,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:18:36,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:18:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:18:36,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:18:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:18:36,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:18:36,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-09-30 23:18:36,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:18:36,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:18:36,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:18:36,865 INFO L87 Difference]: Start difference. First operand 11098 states and 26149 transitions. Second operand 19 states. [2018-09-30 23:19:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:19:08,976 INFO L93 Difference]: Finished difference Result 25128 states and 58685 transitions. [2018-09-30 23:19:08,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 23:19:08,976 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-09-30 23:19:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:19:08,994 INFO L225 Difference]: With dead ends: 25128 [2018-09-30 23:19:08,994 INFO L226 Difference]: Without dead ends: 14031 [2018-09-30 23:19:09,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=514, Invalid=3518, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 23:19:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14031 states. [2018-09-30 23:19:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14031 to 11149. [2018-09-30 23:19:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11149 states. [2018-09-30 23:19:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11149 states to 11149 states and 26230 transitions. [2018-09-30 23:19:29,309 INFO L78 Accepts]: Start accepts. Automaton has 11149 states and 26230 transitions. Word has length 24 [2018-09-30 23:19:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:19:29,310 INFO L480 AbstractCegarLoop]: Abstraction has 11149 states and 26230 transitions. [2018-09-30 23:19:29,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 23:19:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 11149 states and 26230 transitions. [2018-09-30 23:19:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 23:19:29,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:19:29,313 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:19:29,313 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:19:29,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:19:29,314 INFO L82 PathProgramCache]: Analyzing trace with hash 556057282, now seen corresponding path program 1 times [2018-09-30 23:19:29,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:19:29,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:19:29,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:29,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:19:29,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:19:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:19:29,424 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:19:29,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:19:29,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:19:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:19:29,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:19:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:19:29,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:19:29,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-09-30 23:19:29,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 23:19:29,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 23:19:29,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:19:29,605 INFO L87 Difference]: Start difference. First operand 11149 states and 26230 transitions. Second operand 19 states. [2018-09-30 23:20:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:20:05,840 INFO L93 Difference]: Finished difference Result 27547 states and 64697 transitions. [2018-09-30 23:20:05,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 23:20:05,840 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-09-30 23:20:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:20:05,860 INFO L225 Difference]: With dead ends: 27547 [2018-09-30 23:20:05,860 INFO L226 Difference]: Without dead ends: 16399 [2018-09-30 23:20:05,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=3104, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 23:20:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. Received shutdown request... [2018-09-30 23:20:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 11168. [2018-09-30 23:20:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11168 states. [2018-09-30 23:20:24,314 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 23:20:24,321 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 23:20:24,321 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:20:24 BoogieIcfgContainer [2018-09-30 23:20:24,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:20:24,324 INFO L168 Benchmark]: Toolchain (without parser) took 842619.72 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 686.8 MB in the end (delta: 766.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-30 23:20:24,325 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:20:24,325 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:20:24,326 INFO L168 Benchmark]: Boogie Preprocessor took 54.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:20:24,326 INFO L168 Benchmark]: RCFGBuilder took 892.65 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 23:20:24,327 INFO L168 Benchmark]: TraceAbstraction took 841618.50 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 686.8 MB in the end (delta: 734.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-30 23:20:24,331 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.85 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 47.73 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 54.86 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 892.65 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 841618.50 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 686.8 MB in the end (delta: 734.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 841.5s OverallTime, 71 OverallIterations, 2 TraceHistogramMax, 611.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18505 SDtfs, 78608 SDslu, 76676 SDs, 0 SdLazy, 177711 SolverSat, 20342 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 179.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3594 GetRequests, 789 SyntacticMatches, 16 SemanticMatches, 2789 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88997 ImplicationChecksByTransitivity, 60.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11149occurred in iteration=70, 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: 213.6s AutomataMinimizationTime, 71 MinimizatonAttempts, 83666 StatesRemovedByMinimization, 70 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 1844 NumberOfCodeBlocks, 1844 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 1739 ConstructedInterpolants, 0 QuantifiedInterpolants, 148862 SizeOfPredicates, 194 NumberOfNonLiveVariables, 1669 ConjunctsInSsa, 364 ConjunctsInUnsatCore, 105 InterpolantComputations, 37 PerfectInterpolantSequences, 141/299 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Cannot interrupt operation gracefully because timeout expired. Forcing shutdown